Design a recursive version of the Euclidean algorithm (question 3 of Section 5.2). Suppose we apply both Check1 and Check2 (defined next) to the input value 1. What is the difference in the printed...

Design a recursive version of the Euclidean

algorithm (question 3 of Section 5.2).

Suppose we apply both Check1 and Check2

(defined next) to the input value 1. What is

the difference in the printed output of the two

routines?

def Check1 (num):

 if (num % 2 == 0):

 print(num)

 Check1(num + 1)

def Check2(num):

 if (num % 2 == 1):

 print(num)

 Check2(num + 1)