Consider the following algorithm for computing a x given a and x:

a. What is the running time of this algorithm?

b. What is the recurrence relation for the running time?

function power (a, r) if (ar 0) then return (1) if (ar is even then return (power(a, r/2 else return (a (power (a, Ir/2 ))2)