Learn about new technologies! # 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?

mn

max(m,n)

min(m,n)

m+n-1