(a) Give an example of two lists L1, L2, each of which is in ascending order and contains five elements, and where nine comparisons are needed to merge L1, L2 by the algorithm given in Lemma 12.1.
(b) Let m, n e Z+ with m < n. Give an example of two lists L1, L2, each of which is in ascending order, where L1 has m elements, L2 has n elements, and m + n - 1 comparisons are needed to merge L1, L2 by the algorithm given in Lemma 12.1.