Please help me start this assignment in Java. Write two algorithms to implement these policies FIFO and LRU. Assume the number of page frames is variable (2 to 5), and it will be one of the data inputs. The program will print out the statistical results and graphical outputs similar to these images below. Thank you very much for your help

thal 0 on the basis of only one example, will never cause an increase in the number of page interrupts. Page Requested: A Page Frame 1 age ular queue g the page s reference nter seeks ate for rem es page Page Frame 2 new p (empty) Interrupt: Time: 1 (figure 3.9) Memory management using an LRU page removal policy for the program shown in Figure 3.8. 2 3 4 5 6 7 8 9 10 Throughout the program, 11 page requests are issued, but they cause only 8 page interrupts. The same cannot be said about FIO