Assume a main memory with four page frames (frame A through frame D). Assume that the sequence of pages requested by a process is as shown below. 4, 1, 7, 10, 8, 4, 8, 7, 1, 4, 7, 10, 4, 8,4, 1, 7, 10 For each reference in the above sequence, identify whether it will cause a page fault (F) or will result in a page hit (H), when using the page replacement algorithm specified in the questions below. For each question, use the table provided for your solutions - use the Status column to indicate For Hand the Page Frame column to indicate into which page frame the page has been loaded. In each question, assume that all page frames are initially empty and start assigning pages to frames in order of frame name (i.e., frame A first, then frame B, etc.). Question 2 9 pts Given the above information, complete the table presuming the we are using a Second Chance (variant of FIFO) page replacement policy: Page Status Page Frame 4 Select] Select] 1 [Select] [Select] [Select] ( Select] [Select] [Select] [Select] [Select] [Select] Select] Select] [ Select] [Select] [Select ] Select] [ Select] 4 [Select] [Select] [Select] [Select] [Select] [Select] 4 [Select] [Select] & [Select] Select] Select] [ Select] [Select] [Select ] [Select] [ Select] [Select] [Select]