[JAVA] Page replacement algorithm

Question

Hi. I'm trying to implement this algorithm:

Define a page-replacement algorithm addressing the problems of:
1. Initial value of the counters—0.
2. Counters are increased—whenever a new page is associated with that frame.
3. Counters are decreased—whenever one of the pages associated with that frame is no longer required.
4. How the page to be replaced is selected—find a frame with the smallest counter. Use FIFO for breaking ties.

I'm using code for a FIFO algorithm as a template:
https://codeshare.io/5zA8er

Could someone guide me please I'm new to coding.

Thanks!