Consider a relation r that takes up 100 blocks on disk. If you have exactly 8 blocks of memory available:

a) How many passes would be required to perform an external sort-merge? Recall that sortmerge requires 1 initial sorting phase + some number of merging passes. Please be clear if you are including the sorting phase in your answer or just number of merging steps.

b) What is the estimated block transfer cost of performing external sort-merge given these numbers? (100 blocks of data and 8 blocks of memory) Please do not count the final write of the sorted output.

c) How many memory blocks would you need to sort relation r in exactly 2 passes total (1 sorting phase + 1 merging phase)?