analyze the following recursive operation, opP, $($assume variable b is a power of $2)$

i$.$ Derive the initial recurrence relation T$($n$)$

ii$.$ Using repeated substitution, show the kth step. Must show at least $5$ substitutions.

iii. Derive a closed form solution to function T$($n$)$

int opP$($int a$,$ int b$)\{$

if $($b$==0)$return $1$;

if $($b$==1)$return a;

if $(($b $\%2)==0)$

return opP$($a $*$ a$,$ b$/2)$;

else

return opP$($a $*$ a$,$ b$/2)*$ a;

$\}$