How many recursive subproblems are solved by the merge sort algorithm applied to a sequence of n elements?
1) 2⁽ⁿ/²⁾
2) n/2
3) 2ˡog_2(n) - 1
4) 2ⁿ - 1