What is the worst$-$case runtime complexity of selection sort, assuming that the problem size $n$ represents the number of items to be sorted.

$A$

$O(1)$

$\backslash$table$[[O,O(n)$