We will develop an efficient divide$-$and$-$conquer algorithm for the following problem: You are given an array $T$ of $n$ numbers, and you

notice that some of the numbers are duplicates; that is$,$ they appear more than once in the array $T.$ You need to remove all duplicates

from the array $T.$ Our starting point is algorithm Algo below with the following Output specification and a merge procedure Merge$-2$:

Note: Above, $,$ resp.$)$ means that input array $K(L,$ resp.$)$ is empty. Comparison operators op $p_2,o{p}_3$ will be

defined later. And $"$ @ $"$ is a concatenation of arrays operator, for instance, if $K[1]=[23]$ and $K[2,$dots,$5]=[11,7,20,20],$ then

$K[1]$@$K[2,$dots,$5]=[23,11,7,20,20].$ In procedure Merge$-2$ and in this question, when we say "sorted" we always mean sorted

in non$-$decreasing order. Observe that we insist that the input arrays $K$ and $L,$ as well as the output array $Q$ are all sorted. Our

convention is also that $K[2,1]$ and $L[s,1]$ are empty arrays for $s2.$

The algorithm Algo with procedure Merge$-2$ correctly solves the problem of removing duplicates from the input array $T[1,$dots,$n]$ if we

use the following set of parameters in Merge$-2$:

$o{p}_{2}is$; $op3is>$;$s=2$

$o{p}_{2}is$; $op3is>$;$s=1$

$o{p}_{2}is>$;$o{p}_{3}is>$;$s=1$

$o{p}_{2}is>$;$o{p}_{3}is$ ; $s=2$

$o{p}_{2}is$;$o{p}_{3}is$;$s=2$