Consider this sorting algorithm to sort n integers in array

A$[1...$ n$].$ First, find the smallest element and swap it with A$[1].$ Next,

find the second smallest element and swap it with A$[2].$ Repeat the

process until all n elements are sorted.

What are the worst$-$case and best$-$case running time complexities

for this algorithm? You can express your answer in terms of big$-$Oh

$($O$(.))$ or Theta $(\backslash$Theta $(.))$ notation. The more precise you get the better

it is$.$ Therefore Theta is preferable