$(15$ points$)$ Use divide$-$and$-$conquer methodology to design an $(logn)$ algorithm to compute $a^n,$ where a and $n$ are two positive integers. Give the pseudocode of your algorithm.