Suppose that R = 1 0 3 2 3 4 0 3 0 1 2. Given a window size…
Suppose that R = 1 0 3 2 3 4 0 3 0 1 2. Given a window size of 3. Assuming the primary memory is initially unloaded and LRU is used. How many page faults will R incur under the working set algorithm? What is its behavior?