[8 pts.] Demand Paging: Consider the reference string R and an allocation of 3 frames for a given process. For each of the following, show the memory representation and calculate the total number of page faults. Indicate an asterisk (*) for each page fault. R = {5, 4, 3, 1, 4, 5, 6, 7, 4, 5, 4, 3, 5, 7, 3, 4, 5, 4, 3, 7} A) Show the memory representation using the LRU algorithm. page 5 4 3 1 4 5 6 7 4 5 4 3 5 7 3 4 5 4 3 7 F0 F1 F2 * Total number of page faults: ____ B) Show the memory representation using the OPT (Optimal) algorithm. page 5 4 3 1 4 5 6 7 4 5 4 3 5 7 3 4 5 4 3 7 F0 F1 F2 * Total number of page faults: ____ C) Show the memory representation using the LFU (Least Frequently Used) algorithm. page 5 4 3 1 4 5 6 7 4 5 4 3 5 7 3 4 5 4 3 7 F0 F1 F2 * Total number of page faults: ____ 10