Trace through the following algorithm, if it is invoked as GCD$(30,16).$ Use a top$-$down evaluation. $($Recall that $"$n mod m$"$ is the remainder when n is divided by m$.)$

function GCD$($m$,$ n $\{0,1,2,3,\})$

if

n $=0$

thenreturn melsereturn GCD$($n$,$ m mod n$)$