Answer:Idk sry
Step-by-step explanation:
B . Approaches -4
I’m pretty sure it’s -4
Answer:
40 feet
Step-by-step explanation:
the diameter is just Rx2 (R being the radius)
The base case is the claim that

which reduces to

which is true.
Assume that the inequality holds for <em>n</em> = <em>k </em>; that

We want to show if this is true, then the equality also holds for <em>n</em> = <em>k</em> + 1 ; that

By the induction hypothesis,

Now compare this to the upper bound we seek:

because

in turn because
