Using Jeliot, execute the following algorithm which implements a buffer pool alg

Using Jeliot, execute the following algorithm which implements a buffer pool alg

Using Jeliot, execute the following algorithm which implements a buffer pool algorithm. The algorithm offers options for three different heuristics including LRU, LFU, and FIFO. SHOW ALL SCREENSHOTS AND ALL WORK.
import Prog1Tools.IOTools;
import java.util.*;

class replacepage
{
public static void main(String args[]) {

boolean flag;
int f, page=0, ch, pgf=0, n, chn=0, k, pt;
int pages[];

//pgf-page fault

System.out.println(“Menu 1.FIFO 2. LRU 3. LFU”);
System.out.println(“ENTER YOUR CHOICE: “);

Scanner in = new Scanner(System.in);
ch = in.nextInt();
switch(ch)
{
case 1:
pt=0;
System.out.println(“enter no. of buffers (available buffers in the pool): “);
f=in.nextInt();
int buffer[]=new int[f];
for(int i=0;i