85 Problem 8: The following two sub problems involve Fermat's Theorem. (a) Using Fermat's Theorem, find 3201 mod 11. (6) Using Fermat's Theorem, find a number x between 0 and 28 with x congruent to 6 modulo 29. (you should not use any brute-force searching) Problem 9: The following two sub problems involve Euler's Theorem. (a) Using Euler's Theorem, find a number a between 0 and 9 such that a is congruent to 71000 mod 10. (note: this is the same as the last digit of the decimal expansion of 71006) (b) Using Euler's Theorem, find a number x between 0 and 28 with x 85 congruent to 6 modulo 35. (you should not use any brute-force searching)