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. N-1 b. Show that your procedure requires no more than O(log n) multiplications. (REAL BIG HINT: XNXX if N is even, and XNXX X if N is odd.) = = . 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. N-1 b. Show that your procedure requires no more than O(log n) multiplications. (REAL BIG HINT: XNXX if N is even, and XNXX X if N is odd.) = = .