As shown below, the optimal algorithm would result in only 9 page faults for a string of page references (7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1) for a process with 3 physical frames. For a different string of page references (4, 5, 4, 3, 7, 4, 6, 7, 5, 4, 7, 4, 6, 7), draw a similar figure to show the frame allocation and replacement under the following replacement policies: a. FIFO (first-in-first-out) b. LRU (least recently used) c. Clock (second-chance reference bit). Note that the replacement pointer points to the next page after each reference. d. Optimal (assume the page reference string continues with 1, 2, 0, 1, 7, 0, 1) e. List the total number of page faults and the miss rate for each policy