please answer with both questions

Paging Q2. Consider a user program of logical address of size 6 pages and page size is 4 bytes. The physical address contains 300 frames. The user program consists of 22 instructions a, b, c, ... u, v. Each instruction takes 1 byte. Assume at that time the free frames are 7, 26, 52, 20, 55, 6, 18, 21, 70, and 90. (The physical address = page size * frame number + offset) Find the following? A) Draw the logical and physical maps and page tables? B) Allocate each page in the corresponding frame? C) Find the physical addresses for the instructions m, d, v, r? D) Calculate the fragmentations if exist? Q3. Consider a system with memory mapping done on a page basis and using a single level page table. Assume that that necessary page table is always in memory. a. If a memory reference takes 200 ns, how long a paged memory reference takes? b. If there are 2 level page tables, what is the time now? c. Now we add, MMU that imposes an overhead of 20ns on a hit or a miss. If we have 85% hit ratio, what would be EAT