(1 point) The extended Euclidean algorithm computes the god of two integers ro and r as a linear combination of the inputs. ged(ro, r) = s.ro +turi Here s and t are integers known as the Bezout coefficients. They are not unique. The algorithm works like the standard Euclidean algorithm, except that at each stage the current remainder ri is expressed as a linear combination of the inputs. ri = siro + tiri. This produces a sequence of numbers ro, r1, ...,In-1, In where rn = 0 and ged(ro,r1) = rn-1. Suppose that ro = 333 and r = 277. Give the sequence ro, r1, ...,Vn-1,rn in the blank below. Enter your answer as a comma separated list of numbers. What is GCD(333,277)? What is s? What is t