Implementation of a Disk-based Buffer Pool A buffer pool is an area of main memory that has been allocated for the purpose of caching data blocks as they are read from disk. The main purpose of a buffer pool is to minimize disk I/O. Tasks: Implement a disk-based buffer pool application based on the below three buffer pool replacement schemes: FIFO (first in, first out), LRU (least recently used) and LFU (least frequently used) buffer pool replacement strategies. FIFO (First In, First Out): the oldest data block in the buffer pool is replaced. LRU (Least Recently Used): the least recently accessed data block in the buffer pool is replaced. LFU (Least Frequently Used): the least frequently accessed data block in the buffer pool is replaced. Initially, the buffer pool is free. Disk blocks are numbered consecutively from the beginning of the file with the first block numbered as 0. When I execute your program, First, it asks the user to input the following parameters: o a: number of blocks in the buffer pool o b: number of blocks on the disk, of course b 2a. c: the size of each block in bytes (i.e., 1024) o l: number of disk address accesses o per: the percentage of the I accesses that are writes, in the range of [0,1]. When 0, all the accesses are reads; when 1, all the accesses are writes. Then your program generates the / address requests, each is a random number in the range of [O, b *c- 1], the entire address space of the disk. The disk and buffer pool accesses take place as follows. For each read access, it checks if the requested data block containing that address is already in the buffer pool. If yes, there is no I/O; otherwise, the data block is brought into an empty data block of the buffer pool from the disk, causing one I/O. However, if the buffer pool is full and the requested data block is not in buffer block, then one of the three block replacement algorithms (i.e., FIFO, LRU, and LFU) will be used to evict one of the existing data blocks in the buffer pool, so the requested data block can be brought into the buffer pool from the disk. For each write access, your program checks if the data block containing that address is in the buffer pool. If yes, then there is no I/O, and the block is marked dirty (which means the block is updated and needs to be written back to the disk). Otherwise, the data block is brought into an empty data block of the buffer pool from the disk, causing one I/O, and the block is then marked dirty. However, if the buffer pool is full and the newly requested data block is not in the buffer