Q1: De ne a function named max that takes three integers as its arguments and returns the largest
integer among the three. Note that you can't use any Python library functions in your function def-
inition. Provide your function de nition in a .py  le named Q1.py. Do not include any top-level
testing code in your Q1.py.
Q2: We have implemented Euclidean algorithm to  nd the greatest common divisor of two non-negative
integers. We also discussed some other algorithms to  nd the greatest common divisor in Week 1.
Now implement one of such algorithms (any one you like) to  nd the greatest common divisor of
two non-negative integers, but NOT Euclidean algorithm.
Note:
1) Your algorithm has to be implemented in a function and the function should be named gcd
2) Provide your function de nition in a .py  le named Q2.py
3) Do not include any top-level testing code in your Q2.py

全英文的？