Suppose when merge sorting you could recursively sort four sub-lists instead of two and still merge them all in linear time. Give the recurrence relation that describes this. Solve the recurrence relation or use the master theorem to see how this compares to the standard definition of merge sort.