External Merge Sort is necessary when you cannot store all the data into memory. The best you can do is break the data into sorted runs and merge the runs in subsequent passes. The length of a run is tied to your available buffer size.
Assume that 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is__ ?
