PLEASE SOLVE ALL FOR THUMBS UP!!!!!

3. [25 points Use proof by induction to prove the correctness of Algorithm 1 to compute a", where a E N+ and n EN+ Recall: If a number m is odd then m = 21 + 1 for some l E N. If a number k is even then k = 2p for some p Algorithm 1: power(a, n) 1 if n = 0 then 2 | return (1) 3 end 4 if n== l then s return (a) 6 en 7 if n mod 2 0 then return (power a,X power a, g else I return (a power (aBI): power (ael)) 11 end 3. [25 points Use proof by induction to prove the correctness of Algorithm 1 to compute a", where a E N+ and n EN+ Recall: If a number m is odd then m = 21 + 1 for some l E N. If a number k is even then k = 2p for some p Algorithm 1: power(a, n) 1 if n = 0 then 2 | return (1) 3 end 4 if n== l then s return (a) 6 en 7 if n mod 2 0 then return (power a,X power a, g else I return (a power (aBI): power (ael)) 11 end