Please write a full answer and explain well

Consider the following page reference string of a program referencing four pages: Reference number 1.2.3.4. 5.6.7.8. Page reference string0131 2 012 Readorwriteaccess R R?wlwRRR|W (R-Read/W-Write) Assume that the program is executed in a system with 3 frames that are initially empty (and thus even their initial allocation leads to page faults): What is the contents of the frames after each access and how many page faults occur using the page replacement policies below? 1. First-In-First-Out (FIFO: either using Clock-like implementation or using real FIFO qu eue that copies pages from frame to frame), 2. Second-Chance/Clock 3. Enhanced-Second-Chance (also called NRU), Note: A periodic reset of the "referenced" bit of all page table entries takes place just immediately after the 3rd and the 6th reference. 4. Least-Recently-Used (LRU), 5. Optimal (OPT)