2. Extended Euclidian Algorithm (page 4 of last lecture, more on algorithms) Write code that asks for and gets two integers, then computes and displays their greatest common divisor using the Extended Euclidian Algorithm (EEA). The EEA should be implemented as a function that takes two integers are arguments and prints their GCD proceedure EEA(int: a, b) old s= 1 old t 0 old r=a while r != 0 q old-r div r old r=r Fold-r-q*r old s=s s-old s - q*s old t-t t-old t-q*t printc"GCD-" old r) return (t,s)