a.
1. 0
2. Whenever a new page is associated with that frame.
3. Whenever one of the pages associated with that frame is no longer required
4. Find a frame with the smallest counter. Use FIFO for breaking ties.
b. 14 page faults
c. 11 page faults

One way to implement the second-chance algorithm (sometimes referred to as the clock algorithm) is as a circular queue. A pointer (that is, a hand on the clock) indicates which page is to be replaced next. When a frame is needed, the pointer ad