Analyze the time complexity of the SelectionSort algorithm below.

Use the Big$-\backslash$Theta notation: T$($n$)=\backslash$Theta $(?).$ Provide justification for your result.

SelectionSort$($A$,$ n$)$

$1$ for j $=0$ to n $-1//$ Iterate through the array

$2$ minIndex $=$ j $//$ Assume j has the minimum value

$3$ for i $=$ j $+1$ to n $-1//$ Search right$($unsorted$)$ part of A

$4$ if A$[$i$]$ A$[$minIndex$]//$ Compare with the current minimum

$5$ minIndex $=$ i $//$ Update the index of the minimum

$6$ swap A$[$j$]$ and A$[$minIndex$]//$ Move minimum to j