It’s either b or d. Hope this helps! :)
Convert the percentage into a decimal


20% of 50 is 40
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

Answer:
<h2><em><u>x</u></em><em><u> </u></em><em><u>=</u></em><em><u> </u></em><em><u>0</u></em></h2>
Step-by-step explanation:
8(2 + x) = 3x + 16 + 5x
=> 16 + 8x = 3x + 16 + 5x
=> 8x - 3x - 5x = 16 - 16
=> 0x = 0
=> <em><u>x = 0 (Ans)</u></em>
Is there a problem equation?