Please explain how to do these, don't understand induction proofs.

(1) Use induction to show that - (10,4 "). (2) Prove that the following method returns the maximum element of the array. int getMax(int[] A) { int max = A[0]; for(int i=1;imax) max = A[i]; return max; (3) Consider the recurrence T(1) - 4, T(n)-T(n-1)+4, n>1. Use induction to prove that the solution is T(n) 4n. (4) Consider the recurrence TO) 1, T(n)-T(n-1) +2", n >0. Use induction to prove that the solution is T(n) - 2n+1 -1. (5) Use induction to show that Ig(n) 1