The given procedure resembles something like Bubble sort or Selection Sort.
Every time, for every input it will take $O(n^2)$ so, B is the answer.
If you are thinking about heap sort, where in the procedure, it is talked about building a heap? You can do extract_max only on a heap. Right ? The procedure is nearly same as bubble sort or selection sort.
Read question again: "First find the maximum. Remove this element from the list and find the maximum of the remaining elements, remove this element, and so on, until all elements are exhausted."
Just follow the steps. Find max, take it to right side of array. Shift.
So $n-1$ comparisons & $n-1$ shifts in the worst case.
Total $n-1+n-2+n-3+....+1 + n-1+n-2+n-3+..+1 $ which is $O(n^2)$
Only number of comparisons is asked... which is also $\mathbf{O(n^2)}$