1. Consider a pure paging system that uses 32-bit addresses (each of which specifies one byte of memory), contains 128MB of main memory and has a page size of 8KB. a. How many pages frames does the system contains? b. How many bits does the system use to maintain the displacement, d? c. How many bits does the system use to maintain the page number, p? 2. Consider a pure paging system that uses three levels of page tables and 64-bit addresses. Each virtual address is the ordered set v=(p,m,t, d), where the ordered triple (p,m,t) is the page number and d is the displacement in to the page. Each page table entry is 64 bits ( 8 bytes). The number of bits that store p is np, the number of bits that store m is mn and the number of bits to store t is nt a. Assume np=nm=nt=18 i. How large is the table at each level of the multilevel table? ii. What is the page size, in bytes? b. Assume np=nm=nt=14. i. How large the table at each level of the multilevel page table? ii. What is the page size, in bytes? c. Discuss the trade-off of large and small sizes