2. Consider a buffer pool with a total of 10 buffer frames (numbered 0 to 9 ). Suppose that an application needs to make three repeated sequential scans of a file that has a total of 11 pages (p1 to p11) resulting in the following sequence of page requests: 1n+1scanp1,p2,,p11,2ndscanp1,p2,,p11,3+dscanp1,p2,,p11. Assume the following for this question: 1. All the buffer frames are initially in the free list. 2. Access to a page p requires a disk page read if p is not in the buffer pool. 3. For each accessed page p, the application always unpins p before making the next page request (i.e., there are no pinned pages in the buffer pool when a page request is issued). (a) How many disk page reads are incurred under the LRU replacement policy? (b) How many disk page reads are incurred under the Clock replacement policy? (c) How many disk page reads are incurred under the MRU replacement policy