(1 point) Euler's Theorem states that whenever " is an integer and a is an integer such that god(a, n) = 1, a =1 mod n where cp(n) is the Euler totient function. a) If n = 332, then p(n) = b) If a = 508 and n = 875, then efficiently compute 508600 mod 875 c) If a = 611 and n = 1000, then efficiently compute 611 . 61 1399 mod 1000 Use the Extended Euclidean Algorithm to compute 611- = mod 1000. Then 61 1399 mod 1000. d) If a = 153 and n = 220, then efficiently compute 15382 mod 220