Q1: according to the aging page replacement algorithm, fill in the bits for the 6 pages below, after clock tick 1.

Assuming a page fault occurs on clock tick 1, which page will be a candidate for removal?

R bits for pages 0-5, clock tick 0 R bits for pages 0-5, clock tick 1 110/110 111 111101010 Page 0 10000000 1 00000000 2 10000000 3 00000000 10000000 5 10000000 R bits for pages 0-5, clock tick 0 R bits for pages 0-5, clock tick 1 110/110 111 111101010 Page 0 10000000 1 00000000 2 10000000 3 00000000 10000000 5 10000000