(i) Apply Merge Sort for the following sequence of numbers. Divide the N- element sequence into Three Subsequences of n/3 elements each. Show the simulation of every step. 10 3 12 |5 7 4 2 (ii) (iii) Draw the Recursion Tree and compute the cost. Write down Recurrence Relation.

The distinction between validation and verification is crucial. Do you agree that some examples would be helpful?

Can you tell me what kinds of stuff go into making an ADT? Indicate your answer where indicated.

What does npm stand for exactly? In your own words, please provide a short explanation.