1 Fig. 2 2. Fig. 2 shows a circular list for clock page replacement algorithm. The reference bit for page A, B, C, D, E, F, G, H, I, J, K, L is 1, 1, 1, 1,0, 0, 0, 0, 1, 1, 1, 1, correspondingly. Which page will be replaced when page fault occurs? Answer: 3. A computer has four page frames and eight pages. Assume Least Recently Used (LRU) page replacement algorithm is used. How many page fault will occur with the refrence string 0 70540412? Page fault: After above processing is finished, the linked list becomes