(3) (10 points) Use the previous result to prove that the Python function ged above will never need more than 2+log2 b divisions to compute the ged of a and b. (In particular, the Euclidean Algorithm is polynomial-time in the input size log2 a +log2 b)