Problem #2. Assume a virtual memory system with 4KB pages, a four-entry fully associative TLB and LRU replacement policy. Assume the following virtual address sequences (treat each separately). If pages must be brought in from disk, increment the next largest page number 4095,31272,15789, 15000,7193,4096,8912 9452, 30964,19136,46502,38110, 16653,48480 TLB Valid Physical Page Number 12 0 4 Page Table Valid Physical page or in disk 0 0 Disk Disk 0 Disk 0 0 Disk Disk 12 a. Given the address stream in the table and initial state of the TLB and page table, show the final state of the system. Also list for each reference if it is a hit in the TLB, a hit in the page table, or a page fault. Problem #2. Assume a virtual memory system with 4KB pages, a four-entry fully associative TLB and LRU replacement policy. Assume the following virtual address sequences (treat each separately). If pages must be brought in from disk, increment the next largest page number 4095,31272,15789, 15000,7193,4096,8912 9452, 30964,19136,46502,38110, 16653,48480 TLB Valid Physical Page Number 12 0 4 Page Table Valid Physical page or in disk 0 0 Disk Disk 0 Disk 0 0 Disk Disk 12 a. Given the address stream in the table and initial state of the TLB and page table, show the final state of the system. Also list for each reference if it is a hit in the TLB, a hit in the page table, or a page fault