2. 120 points]) A computer has four page frames. The time of loading, time of last access, and the R and M bits for each page are as shown below (the times are in clock ticks: Page |Loaded |Last Ret.IRM 0 86 133 202 265 270 295 a) Which page will NRU replace? Not Recently Used) b) Which page will FIFO replace? [First In First Out c) Which page will LRU replace? [Least Recently Used d) Which page will second chance replace? e) Which page will WSClock replace? [Please illustrate using a picture) The NRU (Not Recently Used) algorithm removes a page at random from the lowest- numbered nonempty class. Class O: not referenced, not modified Class 1: not referenced, modified Class 2: referenced, not modified Class 3: referenced, modifed a. d)