41084 Page replacements in Java - Repost

Assume a program is to be executed on a computer with virtual storage. The machine supports 10,000 words of logical memory overall, broken into pages of 100 words each. The machine contains only 400 words of physical memory, enough for 4 pages. Assume that the page table and the corresponding physical memory are empty, and are filled as needed. Suppose that the program references the following sequence of memory locations: 816, 817, 914, 818, 819, 2615, 2616, 912, 913, 2979, 2980, 2981, 820, 821, 2982, 3406, 3407, 914, 915, 822, 916, 917, 3408, 2617, 2618, 824, 2619, 3409, 3410, 3411 example, the first number is 816 means page 8 and address pointer is 16 of that page. 2615 means page 26 etc, The Java program that you write must simulate the contents of the page table as pages are loaded into memory. For any page replacement algorithm, output every page number that causes a page fault, and the contents of the page table at the end of the memory location sequence. The possible page replacement algorithms are: FIFO (first-in, first-out)the oldest page remaining in the page table is selected for replacement LRU (least-recently used)replaces the page that has not been used the longest time. LFU (least-frequently used) Your Java program should contain a GUI that helps you to debug and test your code, and to display the results in a format that is easy to understand. Implement all three of the page replacement algorithms or only two of them and output the total number of page faults and the contents of memory at the end of the sequences of pages for each algorithm. You must include A detailed description of your approach in a word document and all All files necessary for testing your Java application