PYTHON** **This question needs to be solved by JUPYTER NOTEBOOK ONLY** Write a function that takes two positive integers and returns the greatest common divisor (GCD) of the two integers using the Euclid's algorithm. Euclid's algorithm: Starting with two values aa and bb, repeatedly apply the formula: 1. If a