The greatest common divisor is the largest integer that divides two nonnegative integers m,n evenly. Here's an algorithm expressed in pseudocode that outputs the greatest common divisor of m and n : while=0dom,n:=n,mmodnreturnm a. How do we know this algorithm eventually comes to a stop? b. What does the algorithm do for a pair of numbers in which the first number is smaller than the second? What is the largest number of times this can happen during the algorithm's execution on such input? c. Design a recursive algorithm for computing the greatest common divisor. d. Downcode the algorithm in Python