This is C program

And i need complete running code for this assignment please.

Exercise 2. (50 points) Modular exponentiation. The following pseudocode shows how to compute the modular exponentiation ne mod m where n, e, and m are integers such that n >0,e0, and m>1: result = 1 WHILE (e > 0) IF s odd THEN result (result n) mod m n=(n * n) mod m print result Write a C program powerMod.c that prompts the user for three integers n, e, and m and then prints to the standard output the integer n mod m. You can assume that n > 0, e > 0, andm > 1 and all integers are less than 231 -1. The block below shows the expected execution of the program at the command line: $ ./powerMod Please enter n, e, and m: 123 456 789 123456 mod 789 699 Specifically, the powerMod executable first prints the string Please enter n, e, and " to prompt the user to enter the numbers n, e, and m. The user types three integers (123, 456, and 789 in this example separated by whitespaces. When the user hits the return key the program computes the desired value and produces the output "123 ** 456 mod 789 699 on a single line