Please explain and answer the problem

A virtual memory system uses demand paging A particular process has been given a fixed allocation of three pages frames and encounters the following sequence of page references 3 4 0 4 1 3 4 3 1 0 1 For your convenience, a work area is provided at the bottom of this page. Consider the information in Figure 5. What is the total number of page faults for the optimal replacement algorithm? A) 4 pi faults, including 3 compulsory page faults. B) 5 page faults, including 3 compulsory page faults. C) 6 page faults, including 3 compulsory page faults. D) 7 page faults including 3 compulsory page faults. E) None of the above. Consider the information in Figure 5. What is the total number of page faults for the FIFO replacement algorithm? A) 4 page faults, including 3 compulsory page faults. B) 5 page faults, including 3 compulsory page faults. C) 6 page faults, including 3 compulsory page faults. D) 7 page faults including 3 compulsory page faults. E) None of the above. Consider the information in Figure 5. What is the total number of page faults for the LRU replacement algorithm? A) 4 page faults, including 3 compulsory page faults. B) 5 page faults, including 3 compulsory page faults. C) 6 page faults, including 3 compulsory page faults. D) 7 page faults including 3 compulsory page faults. E) one of the above