Python program: Finish the function xgcd(a,b) that returns a triple (d,x,y) of integers where d=GCD(a,b) and ax+by=d. Use the idea of the Euclidean algorithm.

def extendedgcd(a,b): if a (d,x,y)=extendedgcd(b,a) return (d,y,x) if b==0: #basecase return (a,1,0) (d,x,y)=extendedgcd(b,a%b) return #insert a triple of values to return here! (Note, you can figure out each of the values from d, x and y, that were returned in the previous line).