CS3733: Homework/Practice - 08 Consider a demand paged virtual memory system with 3 frames allocated to a process that makes the following sequence of page references 1 2 3 4 25 2 3 2 125 2 1 Assume that initially no frames are allocated to any pages. For each of the following page replacement algorithms, indicate which pages are in memory after each reference and determine which references produce page faults. Circle the page faults. For each algorithm, also give the total number of page faults. Put your answers on the sheet provided. a)FIFO, Number of page faults- page reference2342523 225 2 1 n memory page reference 12 342 523 2 25 21 c) Optimal, Number of page faults ge reference 234 25232521 d) Second chance (please work out on the back)