Devise a recursive algorithm for finding f(n) = xn mod m whenever x, n and m are positive integers based on the fact that xn mod m = ((xn-1 mod m )*(x mod m)) mod m Write a recurrence relation for the algorithm