Consider the following algorithms and their running times. Which one of the following is correct?

List I	List II
A. Breadth-first search	I. Θ(V + E)
B. Rabin–Karp algorithm	II. O(V + E)
C. Depth-first search	III. Θ((n − m + 1)m)
D. Heap sort (worst case)	IV. O(n²)
E. Quick sort (worst case)	V. O(n log n)

1. AA-III, B-II, C-I, D-IV, E-V
2. BA-II, B-III, C-I, D-IV, E-V
3. CA-II, B-III, C-I, D-V, E-IV
4. DA-III, B-I, C-II, D-IV, E-V

Pick an option to check yourself, or open the answer below.