PLS HELP ASAP

1. Virtual Memory: Consider the following page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 How many page faults would occur for the following replacement algorithms, assuming three frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each. (Show all your work) a) (5 points) LRU replacement b) (5 points) FIFO replacement c) (5 points) Optimal replacement d) ( 2 points) What is a Belady's anomaly