What is the running time for Insertion Sort when the input array has values that are in reverse sort order?
\Theta(n^2)\Theta(n)\Theta(\log n)\Theta(n \log n)On each iteration, the ith record will have
to move to the start of the array.
This is the worst case.