Question: (TCO 6) Consider a demand-paging system in which a process is allocated four frames. Let the First In First Out (FIFO) algorithm be used for
(TCO 6) Consider a demand-paging system in which a process is allocated four frames. Let the First In First Out (FIFO) algorithm be used for page replacement. Let the sequence of page references for the process be as follows: 1, 3, 4, 1, 5, 2, 3, 8, 6, 7, 10, 3, 9, 4, 8, 3, 4, 1, 9, 5, 2, 1 At the end of processing the above sequence of references, determine the set of pages resident in memory. Now, identify the page reference from the following that will NOT cause a page fault.