A) Consider a demand-paging implementation with 3 frames, all initially empty. Demonstrate the sequence of page replacements that would occur for the reference sequence for (i) First-In-First-Out (FIFO) and (ii) Least Recently Used (LRU) and (iii) Most Recently Used (MRU). For both cases, calculate the total number of page faults (include every page fault). Reference String: 0 3 2 5 0 3 1 0 3 2 5 1 3 0 3 B) Explain how you could determine whether either of these algorithms suffers from Bélády’s anomaly for this reference string.
C) In the reference string below, identify the optimal working set size for a = 10.?
26157777516234123444343444132344434 44