Home

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

A. mn

B. max(m,n)

C. min(m,n)

D. m+n-1

Please do not use chat terms. Example: avoid using "grt" instead of "great".