Suppose you need to sort a relation of 40 gigabytes, w/4 kb blocks, using a memory size of 40 mgbytes. Suppose the cost of seek is 5milliseconds, while the disk transfer rate is 40mgbytes per second.
a. Find the cost of sorting the relation , in seconds, w/bb = 1 & w/ bb= 100.
b. In each case, how many merge passes are required?
c. Suppose a flash storage device is used instead of a disk , and it has a seek time of 1 microsecond, and a transfer rate of 40 mgbytes per second . Recompute the cost of sorting the relation, in seconds, w/bb= 1 & w/bb= 100, in this setting.