(Solved): The Euclidean algorithm is used to find the greatest common divisor (ged) of two positive integers ...

The Euclidean algorithm is used to find the greatest common divisor (ged) of two positive integers $a$ and $b$. input (a) input $(b)$ while $b>0$ begin $x:?a\mathrm{mod}b$ $a:?b$ b :- $I$ end ged $:=\mathbf{a}$ output (ged) When the algorithm is used to find the greatest common divisor of $a=273$ and $b=110$, which of the following is the sequence of computed values for $x$ ? $\begin{array}{l}2,53,1,0\\ 2,26,1,0\\ 53,5,1,0\\ 53,2,1,0\\ 53,4,1,0\end{array}$