module power calculator problem - to be coded in C. any help??

In this problem, we will write a program that calculates be mod m for given integers b, e and m. We assume that b > 0, e > 0, and m > 1 and all of them are less than 231-1. Here mod is the Modulus operator. In our implementation, we will leverage the following fact ax b mod m=(a mod m) (b mod m)] mod m Consider the following example where b 5, e 3, and m 7. We need to calculate 53 mod 7. By applying the above fact, we have the following: 53 mod'7 = 52 5 mod 7 (52 mod 7) x (5 mod 7)] mod 7 (5 mod 7) x (5 mod 7) mod 7] x (5 mod7) mod 7 In general, we have the following recursion be mod m-[(bmod m) x (b mod m) mod m Write two functions - one will solve the problem using for loop and the other one using a recursive function Sample output. ./modeexpo Enter b:5 Enter e:3 Enter m:7 Result using recursion:6 Result using loop:6