Operating systems CMU

2. Consider the enhanced second-chance algorithm for page replacement. Consider a system with 4 pages (this is entirely unrealistic, we are using this to examine how the algorithm works). Since the list of pages is considered to be a circular queue, we will describe the status (reference bit, modify bit) of the pages in order from the page which is pointed to by the page reference. In your demonstrations, show any changes to page status which occur (a) Show how the algorithm chooses a victim with status of pages: (1,1), (1,1) (b) Show how the algorithm chooses a victim with status of pages: (1,1), (1,0), (c) Show how the algorithm chooses a victim with status of pages: (1,0), (1,1), (d) Show how the algorithm chooses a victim with status of pages: (1,0), (1,0)