In this part, you will look at some further examples of how Strategy $2$ performs compared to Strategy $1.$

i$.$Merging two lists of length m and n respectively never needs more than m $+$ n $1$ comparisons.