Problem 2 (Extended Euclidean Algorithm): Consider the Extended Euclidean Algorithm. Algorithm GCD(a, b): If b = 0 then {we assume a b} return (a, 1, 0) Let q = a/b Let (d, k, l) = GCD(b, a mod b) return (d, l, k lq) Show the steps and intermediate results of applying the Extended Euclidean Algorithm to compute the GCD of 412 and 200.