Assume that the algorithms considered here sort the input sequences in…

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?

I. Quicksort runs in $Θ(n^2)$ time

II. Bubblesort runs in $Θ(n^2)$ time

III. Mergesort runs in $Θ(n)$ time

IV. Insertion sort runs in $Θ(n)$ time