ve the following problems. Without showing your work, you cannot earn the credits (Each question has 8 points) II. Sol Let W 12342341 21 131 4 be a page reference stream. Given a static page frame allocation of 3 and assuming the primary memory is initially ow many page faults will the given reference stream incur using the Optimal strategy? 2. Given the reference string of page accesses: 1 2342341211314 and a system with three page frames, what is the final configuration of the three frames after the true LRU algorithm is applied? 3. Suppose we have the following page accesses: 1234 2341211314 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string