Python: Finish writing the sagemath function wgcd(a,b) below that returns the GCD of a and b. Use the idea of the Euclidean algorithm and a while loop, without using recursion.

def wgcd(a,b): if a0): # Insert code here! return # insert something to return here!