Suppose the relation R has an attribute A with the following 17 records:

16, 8, 22, 6, 27, 28, 26, 3, 31, 18, 19, 14, 13, 19, 5, 2, 21

Show how the sort-merge external sorting algorithm will sort these values, by showing

i. what the initial sorted runs will look like.

ii. what the runs will look like after each merge pass iii. what the final sorted file will look like (split into blocks).

Please note that you do not have to show any further calculations, just show what the file blocks look like for each of the above. You can assume that each block can store 3 records, and that the number of buffer blocks available is nB = 4