Euclidean Algorithm is a method for computing the greatest common divisor (gcd) of 2 positive integers o and b, where a 2b>0,i.e. the largest positive number that divides both a and b. It proceeds as follows: Let ro a andrb be integers such that a 2 b>o. . Apply the division algorithm successively to obtain ?-"mqm +?+2 with The last non-zero remainder and b. = gcd (a, b) Le, is the greatest common divisor of a . The series of successive will look like the following (remember ro a and-b Implement the Euclidean Algorithm in Python. Your program should ask the user to enter 2 positive integers o and b, where a2 b>0, and should output gcdfa,b). Note: since we have not gone over functions in class yet (otherwise you could use your program from Q1 for each of the steps in this question) I will allow you to use the operators// (for quotient) and % for remainder