The number of comparison steps needed to merge the ascending

Solution

First Comparison

-1 from the first list and -4 from the second list

Hence the first entry will be -4

Second Comparison

-1 from the first list and -3 from the second list

Hence the second entry will be -3

Third Comparison

-1 from the first list and -1 from the second list

Hence the third entry will be -1 *(from the second list)

Fourth Comparison

-1 from the first list and 2 from the second list

Hence the fourth entry will be -1 (from the first list)

Fifth Comparison

3 from the first list and 2 from the second list

Hence the fifth entry will be 2 (from the second list)

Since now the second list is completely exhausted we can copy the remaining elements of the first list directly

Hence there are total 5 comparisons in the worst, therefore correct answer is Option C