Given twosorted list of size m and n respectively. The number of comparisons needed the worst case by the mergesort algorithm will be

A

$$m \times n$$

B

maximum of m and n

C

minimum of m and n

D

m + n - 1