In a paging system with 5 frames, consider the following page reference string:
1, 1, 2, 3, 1, 4, 2, 1, 5, 3, 6, 2, 1, 4, 2, 4, 2, 3, 1, 2, 4, 5, 1, 5, 2, 4, 3, 6, 5, 5, 4, 1, 6, 3, 1, 2, 3, 6
1) Compute the number of page fault when the LRU is used with a Stack-Data Structure?
2) How many page faults would occur with the optimal replacement algorithms?