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.)

the answer is b

there are many solutions.

step-by-step explanation:

step 1: simplify both sides of the equation.

4x+6=4x^2+10x−4

step 2: subtract 4x^2+10x-4 from both sides.

4x+6−(4x^2+10x−4)=4x^2+10x−4−(4x^2+10x−4)

−4x^2−6x+10=0

step 3: factor left side of equation.

−2(2x+5)(x−1)=0

step 4: set factors equal to 0.

x=-5/2 or x=1

simplifying

5(x + -6) = 2(x + 3)

reorder the terms:

5(-6 + x) = 2(x + 3)

(-6 * 5 + x * 5) = 2(x + 3)

(-30 + 5x) = 2(x + 3)

reorder the terms:

-30 + 5x = 2(3 + x)

-30 + 5x = (3 * 2 + x * 2)

-30 + 5x = (6 + 2x)

solving

-30 + 5x = 6 + 2x

solving for variable 'x'.

move all terms containing x to the left, all other terms to the right.

add '-2x' to each side of the equation.

-30 + 5x + -2x = 6 + 2x + -2x

combine like terms: 5x + -2x = 3x

-30 + 3x = 6 + 2x + -2x

combine like terms: 2x + -2x = 0

-30 + 3x = 6 + 0

-30 + 3x = 6

add '30' to each side of the equation.

-30 + 30 + 3x = 6 + 30

combine like terms: -30 + 30 = 0

0 + 3x = 6 + 30

3x = 6 + 30

combine like terms: 6 + 30 = 36

3x = 36

divide each side by '3'.

x = 12

simplifying

x = 12

this should .

but which class are u may know that first