Consider the following page reference string:

$02537183063818$

The frames are initially empty. Give the number of page faults with the following page replacement algorithms and what pages are in the frames at the end, assuming three free frames in the system. Assume that filling any empty frame with a page is counted as a fault.

a$)$ FIFO

b$)$ LRU

c$)$ OPT

Please show as much of your work as you can, for partial credit if you are wrong.