3. For the algorithm below, do the time analysis (count the lines in red) by: (a) finding the recursive equation; (b) solving it; (c ) showing the most simple order of growth (big-oh) for the cost function . Consider that n is a power of 4, ie, n=4, for a natural k. Algorithm power (a,n) Input: a0, n 0 (naturals) Output: an if n = 1 then end if R power(a, n/4); return R R*R*R return a