1.9 Given 2 sorted lists of size “m” and “n” respectively. The number of comparisons needed in the worst case by merge sort will be
A) m*n
B) Max ( m, n)
C) Min (m, n)
D) m + n –1Given 2 sorted lists of size “m” and “n” respectively.
in C and CPP
