Answer with Step-by-step explanation:
Let

Substitute n=2
Then


Hence, P(n) is true for n=2
Suppose that P(n) is true for n=k >1

Now, we shall prove that p(n) is true for n=k+1

LHS

Substitute the value of P(k)






LHS=RHS
Hence, P(n) is true for all n >1.
Hence, proved