(4 marks, 6 Min)A computer has four frames that are currently filled with pages. The following table shows information about each page including the time the page was loaded into memory, the time the page was last referenced along with the values of the Referenced (R) and Modified (M) bits. Times are given in clock ticks. Page Loaded Last Ref. RM 0 126 279 0 0 1 230 260 10 2 120 272 11 3 160 280 11 Assume different page replacement policies are considered to replace one of these pages. Which page will LRU replace? Choose... Choose... Which page will FIFO replace? Which page will NRU replace? The not recently used (NRU) page replacement algorithm is an algorithm that favours keeping pages in memory that have been Choose... recently used based on Page Loaded Last Ref. RM 0 126 279 0 0 1 230 260 10 2 120 272 11 3 160 280 11 Assume different page replacement policies are considered to replace one of these pages. Which page will LRU replace? Choose... Choose... Which page will FIFO replace? Which page will NRU replace? The not recently used (NRU) page replacement algorithm is an algorithm that favours keeping pages in memory that have been recently used based on reference/modify bits. Which page will the Clock algorithm replace? Choose... Choose... (4 marks, 6 Min)A computer has four frames that are currently filled with pages. The following table shows information about each page including the time the page was loaded into memory, the time the page was last referenced along with the values of the Referenced (R) and Modified (M) bits. Times are given in clock ticks. Page Loaded Last Ref. RM 0 126 279 0 0 1 230 260 10 2 120 272 11 3 160 280 11 Assume different page replacement policies are considered to replace one of these pages. Which page will LRU replace? Choose... Choose... Which page will FIFO replace? Which page will NRU replace? The not recently used (NRU) page replacement algorithm is an algorithm that favours keeping pages in memory that have been Choose... recently used based on Page Loaded Last Ref. RM 0 126 279 0 0 1 230 260 10 2 120 272 11 3 160 280 11 Assume different page replacement policies are considered to replace one of these pages. Which page will LRU replace? Choose... Choose... Which page will FIFO replace? Which page will NRU replace? The not recently used (NRU) page replacement algorithm is an algorithm that favours keeping pages in memory that have been recently used based on reference/modify bits. Which page will the Clock algorithm replace? Choose... Choose