Q$6.$ Assume $($for simplicity in this exercise$)$ that only one tuple fits in a block and memory holds at most three blocks. Show the runs created on each pass of the sort$-$merge algorithm when applied to sort the following tuples on the first attribute: $($kangaroo$,17),($wallaby$,21),($emu$,1),($wombat$,13),($platypus$,3),($lion$,8),($warthog$,4),($zebra$,11),($meerkat$,6),($hyena$,9),($hornbill$,2),($baboon$,12).$

We will refer to the tuples $($kangaroo$,17)$ through $($baboon$,12)$ using tuple numbers t$1$ through t$12.$ We refer to the jth run used by the ith pass, as $r_{ij}.$ The initial sorted runs have three blocks each. They are:

$r11=\{t3,t1,t2\}$

$r12=\{t6,t5,t4\}$

$r13=\{t9,t,t8\}$

$r14=\{t12,t11,t10\}$