f(n) = a·f(n/b) + g(n) is a divide-and-conquer recurrence. Match the algorithms in List I with their recurrences in List II.

List I	List II
A. Binary Search	I. f(n) = 7f(n/2) + 15n²/4
B. Find maximum and minimum of a sequence	II. f(n) = 2f(n/2) + n
C. Merge Sort	III. f(n) = 2f(n/2) + 2
D. Fast Matrix Multiplication	IV. f(n) = f(n/2) + 2

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

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