In this chapter, we described how to compute the kth root of b modulo m. However, you may well have asked yourself if you can have more than one kth root. Indeed, you can. For example, if a is a square root of modulo m, then clearly  a is also a square root of modulo m.(a) Let b, k, and m be integers that satisfy gcd(b,m) = 1 and gcd(k, φ(m)) = 1.Show that b has exactly one kth root modulo m: