What is the general form of a recurrence relation used for merge sort?

a) T(n) = n²
b) T(n) = 2T(n/2) + O(n)
c) T(n) = n log n
d) T(n) = O(n)