virtual memory simulation

You should simulate the following page replacement algorithms: • Random (RAND): The replaced page is selected in random. • First in first out (FIFO): The oldest page in the memory gets replaced. • Least recently used (LRU): The least recently used page in the memory gets replaced. If there are two pages with the same value (the last used time unit), replace the one that is not dirty. If both pages are or neither page is dirty, replace the lower numbered page. • Periodic reference reset (PER): Whenever a page is referenced, its referenced bit is set to 1. After executing every 200 memory references, your program should set all of the referenced bits to zero. When a page fault occurs, first look for an unused page (this will only happen early in your simulation). Then look for an unreferenced page where the dirty bit is off and replace this page. Then look for an unreferenced page where the dirty bit is on and replace that page. If none is found, look for a referenced page where the dirty bit is off and replace that page. Finally, you will have to replace a page that is both referenced and dirty. In order to make result deterministic, always replace the lowest numbered page in a particular category The program should 1- Read only the data from the file data.txt. if I change the data, the code output must change 2-Do not provide data inside the program if the data from the file is missing or incomplete 3-Do not make any improvement or enhancement for the 4 algorithms 4-implement the 4 algorithms independently (RAND, FIFO, PER, LRU)