Exercise 13.1 Suppose you have a file with 10,000 pages and you have three buffer pages. A...

Exercise 13.1 Suppose you have a file with 10,000 pages and you have three buffer pages. Answer the following questions for each of these scenarios, assuming that our most general external sorting algorithm is used:

1. A file with 10,000 pages and three available buffer pages.
2. A file with 20,000 pages and five available buffer pages.
3. A file with 2,000,000 pages and 17 available buffer pages.

1. How many runs will you produce in the first pass?
2. How many passes will it take to sort the file completely?
3. What is the total I/O cost of sorting the file?
4. How many buffer pages do you need to sort the file completely in just two passes?