2 (3 pts) Show that if a = b(mod N) and if M divides N, then a = b (mod M). 3 (3 pts) (a) Use the Euclidean algorithm to find ged(588, 378). bre 294 189 (b) If a and b are n-bit numbers, what is the run-time T(n) of the algorithm? O(log n) O(n) O(n log n) On) On