Problem 1[100 pts]: Write a program that prompts the user to enter three integers called a, m, and n. Then output the result of a m mod n. Notice that the simple algorithm that tries to compute a m by repeated multiplication by a is unlikely to be correct due to overflow errors. Also, for full points, read and implement the algorithm for modular exponentiation given on pages 253-254 of the Rosen book.