Previous question for reference:

Question 3 - Two-Level Page Table Now, consider (4KB). We would lik directory which ref space. For simplicity assume than 1G a computer with 1 GB of physical memory, where the page size is 4096 bytes e to index memory pages using a two level page table consisting of a page ers to page tables which are created on demand to index the entire memory B-1000MB, 1MB-1000KB, 1KB-1000 bytes (a) If we divide the VPN in half from the previous question, how many bits are required for the page directory index in a two-level scheme? (b) How many bits are required for the page table index? (c) How many bits are required for an offset to address any byte in the 1 KB page? (d) Assuming each page table entry (PTE) requires 4 bytes of memory, how many extra bits are available for status bits? (e) To index one variable on a page requires both a page directory and a page table. Assuming both the page directory and page table consist of 4 byte elements, how much memory does each require individually? (f) How much memory is required then to index one variable using a page directory and a page table with the two level scheme. Hint: it will be twice the value of e