a computer has 32-bit virtual address and 4-kb pages. Page table access overhead for 256 entry is 2 ns, for 512 entry 10 ns, for 1024 entry 50ns, for 2018 entry 250 ns and so on. Design the best page table configuration so that we will have to bear least overhead. What will be the worst case overhead among the largest address?