We have a file with N = 1,000,000 pages, and we want to sort it using external merge sort. Let’s assume no double buffering, no blocked I/O, quicksort for in-memory sorting, and B the number of buffers. a. What is the smallest number of buffers B to sort the file with N =1,000,000 pages, in two passes? b. How many passes are required to sort the file with N =1,000,000 pages using 10 buffers?