Question: 7. (15 p) Power of 2 the forth time Algorithm power 4(n) Input: n is a positive integer Output: return 2n If n=1 then Return

7. (15 p) Power of 2 the forth time Algorithm power 4(n) Input: n is a positive integer Output: return 2n If n=1 then Return 2 if n =0 then return power 4(n/2) * power 4(n/2) else return power 4(n/2) power 4(n/2)2 Complete the calling tree when n=10. I started the tree for you. Notice p4() is the abbreviation for power 4(n). I use the for returns. Method powers is 0 ( ) Method power5 is ( )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
