please do not use any code language to solve it$.$

Consider the following relations r$($A$,$B$)$ and s$($B$,$C$),$ and a memory buffer with three blocks, where

each block can store only one entry. Use external sort$-$merge to order the tuples on the B attribute

$($show the intermediate runs produced by the algorithm for each table$).$

Assuming that a query has a buffer holding up to $3$ blocks, and each block can hold two records. Use

external sort$-$merge to sort the following records in ascending order:

$10,11,1,5,90,1,2,101$

$($a$)$ How many runs will be produced in the whole algorithm and what are the contents of the runs?

$($b$)$ Clearly identify what the algorithm will do in each merge pass.

$($c$)$ Over the entire course, how many blocks are transferred from the disk to the memory?