We have a database file with ten million pages (N = 10,000,000 pages), and we want to sort it using external merge sort. Assume that the DBMS uses quicksort for in-memory sorting. Let B denote the number of buffers. 1). Assume that the DBMS has 6 buffers (B=6). How many passes does the DBMS need to perform in order to sort the file?