using this assigned pages referances string 34321243145434

Using your assigned pages reference string: How many page faults would occur for the following replacement algorithms, with three and then four frames? All frames are initially empty. a.) Optimal Replacement b.) FIFO Replacement c.) LRU Replacement d.) LFU or MFU Replacement (choose one) Write up an analysis of these page replacement algorithms. Make sure you reference your tables (or graphs). Which algorithm is the best to implement for your given set of page references? Are there any algorithm(s) that suffer from Belady's anomaly? Explain