Write an inductive proof that X = k2k = 2 + (n − 1)2n+1. 2. Write an algorithm that uses a loop to compute an arbitrary sum Ex=of(k). 3. Prove the correctness of your algorithm. 4. Use your own words to compare your proof of correctness in (3) to the inductive proof of (1) above.