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 / Computer Science and I.T Subjects, Data Structures and Algorithms MCQs / By The Professor A. mn. B. max(m,n). C. min(m,n). D. m+n-1. ANSWER: D