Show that for all positive integers m and n there are sorted lists with m elements and n elements, respectively, such that Algorithm 10 uses m + n − 1 comparisons to merge them into one sorted list.