设计程序模拟先进先出FIFO，最佳置换OPI和最近最久未使用LRU页面置换算法的工作过程。假设内存中分配给每个进程的最小物理块数为m，在进程运行过程中要访问的页面个数为n，页面访问序列为P1, … ,Pn，分别利用不同的页面置换算法调度进程的页面访问序列，给出页面访问序列的置换过程，计算每种算法缺页次数和缺页率。-Design program to simulate FIFO FIFO, the best and most recent displacement most-recently-used OPI LRU page replacement algorithm of the work process. Assuming the memory allocated to each process a minimum number of physical blocks is m, the process is running in the page number to access is n, the page access sequence P1, ..., Pn, respectively, the use of different page replacement algorithm for scheduling process page access sequence, given the sequence of the replacement process to access the page to calculate the number of page faults for each algorithm and the missing page rate.