a. Implement in C++ the external Merge sort algorithm. Assume that the fi le to be sorted is a file of type int and that each block contains one integer. Further assume that the fi le contains 2 n...

a. Implement in C++ the external Merge sort algorithm. Assume that the fi le to be sorted is a file of type int and that each block contains one integer. Further assume that the fi le contains 2 n integers for some integer n .

b. Now assume that each block contains many integers. Write C++ functions that simulate read Block and write Block. Implement external Merge sort by using these functions.

c. Extend your implementation of external Merge sort by removing the restriction that the file contains 2 n blocks.