The following function POWER$($a$,$ n$)$ computes a$^$n$.$

$($a$)$ Prove the correctness of this algorithm.

$($b$)$ Provide the recurrence relation.

$($c$)$ Give the time complexity using Master Theorem.

$($d$)$ Give the time complexity using unrolling.