Solve e to h please, abcd is solved already.

a)PAGE SIZE = 2^offset = 2^8 = 256Byte

b)Number of entries in 1st level page table is = 2^8 = 256 entries

c)Number of 1st level page table is needed = 2^8 / 4 = 64

d)Number of 2nd level page table is needed = 2^16 / 4 = 16K

Assume we have a program that resides in the memory range of 80088000810 FOF00. The numbers are in hexadecimal. Virtual addresses are 32 bits and the system applies three-level hierarchical paging where the address division scheme is: 8888 in which 8 bits are reserved for offset. a) What is the page size (in Byte)? b) How many entries are there in the 1st level page table? c) How many 1st level page table is needed? d) How many 2 nd level page table is needed? e) How many 3rd level page table is needed? f) How much memory space can be mapped by one 3rd level page table (in KB)? g) What is the size of the program in the memory (in KB )? h) How much memory space is needed to store page tables? (Assume each entry in page tables is 4 byte)