Please answer the following questions about paged memory...

A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits.

B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both inner and outer page tables, write down the formula for the Effective Access Time (EAT) for a page reference assuming a hit rate of a, a TLB access time of 60 ns and a memory access time of 200 ns. What must a be for EAT=280 ns? Assume that either both page tables are in the TLB or neither are.