Question $2(12)$:

You are given $6$ runs that have $100,200,300,500,800,1000$ equal$-$length records to be merged into one, using a loser tree. It takes $2$ seconds to read or write one block from$/$to disk and $1$ second of CPU time to merge one block of records. Assume that all input, output, and CPU processing is sequential and there is no waiting time. The block size is $100$ records.

$($a$)(6)$ Give an optimal $4-$way merging scheme to merge the $6$ runs into $1.$

$($b$)(6)$ What is the total time taken by the optimal scheme?

Question $3(14)$: