Assume in a computer supporting paging, virtual addresses are 36 bits long. Page size is 16 KB, no matter which paging structure is used. Assume a page table entry is 8 bytes long, no matter which paging structure is used. The computer has 4 GB of RAM (physical memory). We have three processes (A, B, C) in the system at the moment. The virtual memory layouts of the processes are like the following:
--- A is using 64 MB from the start of its VM and 32 MB from the end. The rest of its VM is unused.
--- B is using 128 MB from the start and 64 MB from the end. The rest of its VM is unused.
--- C is using 32 MB from the start and 32 MB from the end. The rest of its VM is unused. Find out the physical memory required to hold the page table information for these three processes in total, for the following paging structures (i.e., methods).
a) One level page table.
b) Two level page table with address division scheme (11, 11, 14).
c) Inverted page table.
