A system uses the third-chance page replacement algorithm. At time i, the four page frames contain the page numbers and r-bits shown below. The pointer is at the page to be considered next. At time i + 1, page 4 is referenced. Show all changes as a result of the reference. Time t Frame 0 Frame 1 Frame 2 Frame 3 ... 8101 → 5|11 6110 7100 Ex: 3 At time i + 1, which page is the pointer at? Ex: 3 i + 1 | Ex: 01 ***

A system uses the third-chance page replacement algorithm. At time i, the four page frames contain the page numbers and r-bits shown below. The pointer is at the page to be considered next. At time i + 1, page 4 is referenced. Show all changes as a result of the reference. Time t Frame 0 Frame 1 Frame 2 Frame 3 ... 8101 → 5|11 6110 7100 Ex: 3 At time i + 1, which page is the pointer at? Ex: 3 i + 1 | Ex: 01 ***