Part 1 - Page Replacement Algorithm - Process ABC has just caused a page fault to occur. This means that one of the process's pages will have to be evicted from its frame in memory. The table below shows the current information about the pages currently in memory including when the page was loaded into memory, the last time it was accessed, and how many times it had been accessed. - Given the information above, which page will be removed from physical memory based on each of the following page replacement algorithms: First in First Out (FIFO) Optimal Page Replacement Least Recently Used (LRU) Second Chance Enhanced Second Chance Counted-Based - What are the advantages and disadvantages of each of the page replacement algorithms? - Some systems will also include a "dirty" bit as part of the information about a page in memory. This bit will be set to 1 if the contents of the page are altered in any way. A page with a dirty bit of 0 is identical to the copy stored in virtual memory, so it can be overwritten. If the bit is set to 1 , the page must be copied to virtual memory on a disk before it can be overwritten. How would each of the algorithms need to be adjusted if the decision considered the dirty bit