11) suppose n is a large odd number. you calculate 2^ (n-1)/2==k (mod n), where k is some integer k ±1 (mod n) a) suppose k 1 (mod n). explain why this implies that n is not prime. b) suppose k 1 (mod n). explain how you can use this information to factor n.