Consider the computation of m where m and n are two positive integers.

a$.$ Write a procedure expon which accepts m and n and computes m$"$ while using no more than O$($log n$)$ multiplications. You may wish to use the boolean function odd$($n$)$ which returns TRUE if n is odd and returns FALSE otherwise.

b$.$ Show that your procedure requires no more than O$($log n$)$ multiplications. $($REAL BIG HINT: XN $=$ XX if N is even, and XN $=$ X odd.$)$ N$-1=$ Xxx if N is $2$