This is C program

And i need a complete running code for this assignment please.

Also if possible send me screenshot of the output

Exercise 1. (50 points) Modular exponentiation. You have implemented the modular exponentiation in HW1 with a loop. In this problem, you will implement a recursive function to compute the modular ex- ponentiation recursively. A template is provided in powerMod-r.c. Your goal is to complete the powerMod ) function You cannot use loops in the function. Again, you can assume that n> 0, e0, and m> 1 and all of the are less than 21 The following three cases give you hints on how to recursively compute the modular exponentiation ne mod m where n, e, and m are integers such that n >0, e >0, andm1. ife=0 n mod m-(n2 mod m)e/2 mod if e is even (n2 mod m)"/2-n mod m fe is odd The division in the exponent is integer division. Also, pay attention to the common term in the last two cases and recall that (y) mod m-(( mod m) (y mod m) mod m The behavior of powerMod-r.c is similar to powerMod.c. Below is a sample session. $ ./poverMod-r Please enter n, e, and m: 123 456 789 123 ** 456 mod 789 = 699