Consider an algorithm that contains a loop that can be expressed with the following pseudocode:

for$(i=1$ through $n$

Task T

$\}$

If Task T requires $t$ time units, h$$w many time units $($in terms of $t)$ does the entire loop require? $($Note$,$ this is not asking for the Big$-$O of this code.$)$

i

n

$n**t$

$n^{{?}^{{?}^{?}}}2$

$n^{{?}^{{?}^{?}}}2**t$