Problem 2 (a) Find 28-1 (mod 45) (b) Solve 28.0 = 6 (mod 45) Problem 3 (a) Solve 24x = 10 (mod 48). (b) Solve 28x = 12 (mod 44). Problem 4 (a): Find all solutions of 12x = 28 (mod 236). (b): Find all solutions of 12x = 30 (mod 236). Problem 5 (a): Use the EA to compute ged(30030, 257). (b): Using the result of (a) and the fact that 30030 = 2.3.5.7.11 . 13 to prove that 257 is prime. Problem 6 (a): Compute ged(4883, 4369). (b): Factor 4883 and 4369 into products of prime. Problem 7 (a): Define the Fibonacci sequence by F1 = 1, F2 = 1 and Fn+1 = Fn + Fn-1. Use the EA to compute ged(Fn, Fn-1). (b): Find ged(11111111, 11111)