Q4

MCQ1 mark, −0.25

Let $A$ be a sequence of $8$ distinct integers sorted in ascending order. How many distinct pairs of sequences, $B$ and $C$ are there such that $2$ $30$ $56$ $256$

(A)

each is sorted in ascending order,

(B)

$B$ has $5$ and $C$ has $3$ elements, and

(C)

the result of merging $B$ and $C$ gives $A$

Loading…