Given three positive integers x, k and n (1

// Fast modular exponentiation int fme(int x, int k, int n) int temp; int result 1; if (k) temp = fne(x, k , 2, n); result = x % n; // As n 1000, the result of ultiplication // is less than 2 30 result = (result * temp * temp) % n; return result; int main() int x, k, n; printf("Enter the first integer x: "); scanf("%d", &x); printf( Enter the second integer k: "); scanf("%d", &k); printf("Enter the third integer n: "); scanf("%d", &n); /I For example, if you use 987 654 mod 321 as a testcase // The output should be 57 printf("The result of xnk od n-%d ", fne(x, k, n)); return 0