Assume a virtual memory system that uses demand paging. Whenever a PT or page is not resident in memory, the corresponding table entry contains a negative number Segment table and page table entries contain frame numbers of the corresponding page tables or pagea: Size of segment table I size of page table = size of page = size of frame =512 words. Segment table (ST) starts at address 0 of physical memory. Physical memory (PM) has the following contents: Complete the table and determine if the VA causes a page fault. Enter 'N/A' if frame number is unknown. At time i, the four page frames contain the pages shown below. The points to the oldest resident page Page size =512 words. The system uses the FIFO page replacement algorithm. For each virtual address VA enter the corresponding page number p and whether that VA Wil cause a page fault at time i+ 1 . Duma fainit at tima ib 1 The page foult will replace page. and the pointer will move to page A system uses the second-chance page replacement aigorithm At time i, the four page frames contain the page numbers and robits thown beiow . The pointer is at the page to be considered next. At time i+ 1 , page 5 is referenced. Show all changes as a result of the reference. At time i+ 1 , which page is the pointer at