1. Write a function which takes as input two integers a and b, with b > 0 and returns the value of ged(a, b), the sequence X0,X1, ... ,Xk+1 and the sequence yo, Y1, ..., Yk+1 as in the Extended Euclidean Algorithm. It is not required that you validate the input to this function; that is, you may assume that both input parameters will, in fact, be integers, and that b will be positive. Use your code to compute gcd(101918191, 77602037) and provide the corresponding sequences of x's and y's. 1. Write a function which takes as input two integers a and b, with b > 0 and returns the value of ged(a, b), the sequence X0,X1, ... ,Xk+1 and the sequence yo, Y1, ..., Yk+1 as in the Extended Euclidean Algorithm. It is not required that you validate the input to this function; that is, you may assume that both input parameters will, in fact, be integers, and that b will be positive. Use your code to compute gcd(101918191, 77602037) and provide the corresponding sequences of x's and y's