In java and implement Least Recently Used separately from optimal page replacement algorithm.

Optimal Page ReplacementAlgorithm This project consists of implementing the Optimal Page Replacement Algorithm on a reference string. As reviewed in class, the Optimal Page Replacement Algorithm replaces the page that is not going to be used for the longest period of time. Your program should work as follows: Enter a reference string: 7 01 2 0304 2303 2 1 2 0 1 70 1 (required) Enter the # of frames: 3 (your program should be able to support any # of frames) Running simulation: Start: Memory is:* 7: Memory is:7Page Fault: Number of Page Faults: 1) 0: Memory is: 7 0Page Fault: (Number of Page Faults: 2) 1: Memory is: 7 0 1: Page Fault: (Number of Page Faults: 3) 2: Memory is: 2 0 1: Page Fault: (Number of Page Faults: 4) 0: Memory is: 2 0 1:Hit: (Number of Page Faults: 4) 3: Memory is: 2 0 3: Page Fault: (Number of Page Faults: 5) 0: Memory is: 2 0 3: Hit: (Number of Page Faults: 5) 4: Memory is: 2 4 3: Page Fault: (Number of Page Faults: 6) 2: Memory is: 2 4 3: Hit: (Number of Page Faults: 6) 3: Memory is: 2 4 3: Hit: (Number of Page Faults: 6) 0: Memory is: 2 0 3: Page Fault: (Number of Page Faults: 7) 3: Memory is: 2 0 3: Hit: (Number of Page Faults: 7) 2: Memory is: 2 0 3: Hit: (Number of Page Faults: 7) 1: Memory is: 2 0 1: Page Fault: (Number of Page Faults: 8) 2: Memory is: 2 0 1: Hit: (Number of Page Faults: 8) 0: Memory is: 2 0 1: Hit: (Number of Page Faults: 8) 1: Memory is: 2 0 1: Hit: (Number of Page Faults: 8) 7: Memory is: 7 0 1: Page Fault: (Number of Page Faults: 9) 0: Memory is: 7 0 1: Hit: (Number of Page Faults: 9) 1: Memory is: 70 1: Hit: (Number of Page Faults: 9) Total Number of Page Faults: 9 Extra Credit: You may implement Least Recently Used for Extra Credit