For this assignment, we'll look at the efficiency for several sorting algorithms.

Suggestion: there is a fair amount of work involved in this assignment. I suggest that you do the

four parts of this assignment over the course of several days.

Part $1$: $O(n^2)$ sort

Pick a $O(n^2)$ sorting algorithm $($bubble$,$ insertion, or selection$)$ and implement it in a C$++$

program to sort an array of integers. There is $C++$ code in the textbook and online for these

algorithms, but I encourage you to resist the temptation to simply copy it$.$ Add a counter to

the sort function to track the number of times that the function accesses elements from the

array you are sorting. For example, if your function has the line array $[i]=$max that counts

as one array access. If your function has the line if $($array $lognnlogn[i]$