a. Show that if Stein's algorithm does not stop before the nth step, then b. Show that if the algorithm does not stop before step (n 1), then AnB c. Show that if 1 s A, B s 2V, then Stein's algorithm takes at most 4N steps to find gcd(m, n) Thus, Stein's algorithm works in roughly the same number of steps as the Euclidean algorithm. d. Demonstrate that Stein's algorithm does indeed return gcd(A, B)