This is the problem statement :
Consider the following virtual page reference string: 7, 0, 1, 2, 0 ,3, 0, 4, 2, 2, 2, 3, 2, 1, 2, 0. How many page faults would occur if the dynamic page replacement (working set) policy with a window size of 3 is used?
Dynamic Page replacement Algorithm