Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.

How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, and seven frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each.

LRU replacement

FIFO replacement

Optimal replacement

Write a program that calculates number of page faults for given page reference string and number of frames. The program should be written in C and should use 3 libraries:

A static library that calculates number of page faults for LRU

A shared dynamically linked library that calculates number of page faults for FIFO

A shared dynamically loaded library that calculates number of page faults for Optimal replacement