Question 10 40 pts You may assume n is a multiple of two. You are given 3 sorted sequences $A.B.C$ of $2$ and $n$ and $n/2$ keys respectively. We would like to merge them into a sorted sequence of $3.5n$ keys. Give the best way to achieve this, and determine a tight upper bound to the number of comparisons performed in the form $Xn+Y$ where $XY$ are some constants (positive or not) that you will provide. Justify your answer. Edit View Insert Format Tools Table 12ptParagraph BIU AT MAR 11 " X