Match each of the following pseudocode snippets to their $($big$-$Theta$)$ asymptotic runtime. $($If you're new to big$-$Theta, you can think of it as the "smallest" big$-$Oh$,$ i$.$e$.$ if something is O$($n$)$ but not O$($log n$),$ you would answer $,$ not

or anything bigger than n$.)$

Note that since there are no if$-$statements, there is no best$/$worst case.