$(10$ pts$.)$ Find an exact closed$-$form formula for the worst$-$case number of array element comparisons made by

selectionsort $($see lecture notes for exact code$)$ on arrays of size $n.$ Do the same for the number of swaps. Show your

work.