Using the table below, perform the Enhanced Second Chance LRU Approximation Algorithm page replacement algorithm using 4 frames and calculate the total number of page faults that occur. You will specify the reference and modify (dirty) bit in parenthesis, respectively. Remember that all frames are initially empty, so your first unique pages will cost one fault each. Note a page fault with an X in the bottom row, and a hit with a O. 5W 3R 7W 6R 7R 6W 3W ZR 2R 9W 6 6 6 6 16 6 (1,(1, (1, (1, (1, (1, 0) 0) 1) 1) 1) 1) 7 7 7 17 7 (1. (1. (1. (1. (1. - 0) 0) 0) 0) 0) 3 3 3 (1. (1. (1. 1) 1) 1) 2 (1, 0) x x ox OX Total page faults: d Second Chance LRU Approximation Algorithm page alculate the total number of page faults that occur. You bit in parenthesis, respectively. Remember that all e pages will cost one fault each. Note a page fault with w 3R 7W 2R 9R