What is the time complexity $($Big$-$Oh$)$ of the following code fragment in terms of the variable n$?$

for $($int i $=0$; i $<$ n $-1$; i$++)$

$\{$

int index $=$ i;

for $($int j $=$ i $+1$; j $<$ n; j$++)$

if $($v$[$j$]<$ v$[$index$])$

index $=$ j;

int temp $=$ v$[$i$]$;

v$[$i$]=$ v$[$index$]$;

v$[$index$]=$ temp;

$\}$

Group of answer choices