For the FIFO Algorithm:

Create a trace of reference $($no more than $15$ references$)$; And for memory size M$1=3$ and M$2=4,$ demonstrate the Belady Anomaly $($defined in the lecture$).$

For the same trace find the number of page faults $F$ for bot FIFO and Optimal Algorithms