chap file processing and external sorting assume that virtual memory is managed using buffer pool the buffer pool contains five buffers and each buffer stores one block of data memory accesses are by block id assume the following series of memory accesses takes place for each of the following buffer pool replacement strategiesshow the contents of the buffer pool at the end of the seriesand indicate how many times block was found in the buffer pool (instead of being read into memoryassume that the buffer pool is initially empty (afirst-infirst out (bleast frequently used (with counts kept only for blocks currently in memorycounts for page are lost when that page is removedand the oldest item with the smallest count is removed when there is tie(cleast frequently used (with counts kept for all blocksand the oldest item with the smallest count is removed when there is tie(dleast recently used (emost recently used (replace the block that was most recently accessed suppose that record is bytesa block is bytes (thusthere are records per block)and that working memory is mb (there is also additional space available for / buffersprogram variablesetc what is the expected size for the largest file that can be merged using replacement selection followed by single pass of multiway mergeexplain how you got your answer assume that working memory size is kb broken into blocks of bytes (there is also additional space available for / buffersprogram variablesetc what is the expected size for the largest file that can be merged using replacement selection followed by two passes of multiway mergeexplain how you got your answer prove or disprove the following propositiongiven space in memory for heap of recordsreplacement selection will completely sort file if no record in the file is preceded by or more keys of greater value imagine database containing ten million recordswith each record being bytes long provide an estimate of the time it would take (in secondsto sort the database on typical desktop or laptop computer assume that company has computer configuration satisfactory for processing their monthly payroll further assume that the bottleneck in payroll