Let N be an n-bit positive integer, and let a, b, c, and k be positive integers less than N. Assume that the multiplicative inverse (mod N) of a is ak-1 Give an O(n3) algorithm for computing alb mod N (i.e., a raised to the power b with the result taken mod N). Any solution that requires computing b is so inefficient that it will receive no credit. (bc) Hint: You can do this with a few applications of algorithms we have studied lately