$[$Acu$$a$]$ Determine the Big$-$Oh order for each of the following code fragments. Each fragment is parameterized on the variable n and the Big$-$Oh is measuring the number of calls to println. You should provide a relatively tight upper bound $($i$.$e$.,$ not simply O$(2$n$)$O$(2$n$)).$

The answer should be in the format O$()$ For answers with log$,$ do not include a base as it is not required. Ex$1$: O$($n$2)$O$($n$2)$ Will be written out as O$($n$^2)$ Ex$2$: O$($n$2$logn$)$O$($n$2$logn$)$ Will be written out as just O$($n$^2$logn$)$