用一种计算机高级语言来实现请求分页存储管理方式先进先出（FIFO）置换算法，设计要求如下：

⑴ 能够输入给作业分配的内存块数；

⑵ 能够输入给定的页面，并计算发生缺页的次数以及缺页率；

⑶ 缺页时，如果发生页面置换，输出淘汰的页号。-A computer with high-level language to implement demand paging memory management FIFO (FIFO) replacement algorithm, the design requirements are as follows: ⑴ to enter a block of memory allocated to the number of jobs　⑵ to enter a given page, and calculate the occurrence of missing the number of pages and page fault rate　⑶ missing pages, if page replacement occurs, the output out of the page number.