Consider the selectionsort code provided in the lecture materials. What is the exact number of swaps the algorithm performs to sort a sequence of n elements in the best$$case$?$

$2$n$+1$

$1$

$2$n

$2+1$