C++

?Recursive Modular exponentiation

Please read the question carefully. Make sure to print partial results (intermediate steps) of b,n,m (or more details). Partial results is needed.

1. Prompt the user to enter three numbers b, n, and m; where , and . 2. Write a recursive function to find the modular exponentiation bⁿmod m. 3. The function should print partial results and the final result of bⁿmod m.

###################Test Cases (make sure to print the partial results):###################

b = 28, n = 3, m = 17. Answer: 5 b =3768, n = 5, m = 32. Answer: 0 b = 2, n = 5, m = 3. Answer: 2

###################ALGORITHM 4 Recursive Modular Exponentiation.################### procedure mpower(b, n, m: integers with b > 0 and m ? 2, n ? 0) if n = 0 then return 1 else if n is even then return mpower(b, n/2,m)² mod m else return (mpower(b, n/2,m)² mod m b mod m) mod m {output is bⁿ mod m}