Question: We explained in the text why the Merging Algorithm requires at most s + t -1 comparisons to merge ordered lists of lengths s and t. For arbitrary s and t, do there exist ordered lists of these lengths for which precisely s + t - I comparisons are needed to merge? Explain.