HOW CAN WE SOLVE THIS IN LESS TIME ...OR IT IS NECESSARY TO SOLVE FOR EVERY OPTION ...IT IS REALLY TAKING TIME
A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the
pages numbered 1, 2, ..., 100 in that order, and repeats the access sequence THRICE. Which one of the following page
replacement policies experiences the same number of page faults as the optimal page replacement policy for this program?
A. Least-recently-used
B. First-in-first-out
C. Last-in-first-out
D. Most-recently-used
