Suppose you are given a budget of k = 2 jars. describe a strategy for finding the highest safe rung that requires you to drop a jar at most f (n) times, for some function f (n) that grows slower than linearly. (in other words, it should be the case that limn→[infinity] f (n)/n = 0.)

part a

in a city ice cream is mostly only bought when the temperature is very high as ice cream cools down our

so we can derive the conclusion that as the temperature increases the number of ice creams sold also increases

part b

y intercept is 5

slope is 2

happy to

pls mark as brainliest

i believe it is d.) buddhism and e.) hinduism