Create a program that will simulate demand paging using Least Frequently Used. (to resolve conflict, apply first in first out)
Inputs are: list of page requests (string) and number of page frames (integer 1-10)
Sample input:
page requests : ABCBADEABC
page frames : 2
Sample output:
PF1 A A C C A A A A A A
PF2 - B B B B D E E B C
* * * * * * * *