Given a relation R of size 510,000 blocks which is sorted usingthe external sort-merge algorithm. Assume a main memory of 51blocking buffers.
(a) How many sorted runs are produced initially?What is the size of each run? How many merge passes are required tosort R?
(b) How many block transfers are required forsorting R?
Expert Answer
An answer will be send to you shortly. . . . .