A system has a page size of 1KB and maintains page table for every process in the memory. The lookup overhead associated with the page table is 500ns. To reduce the

overhead, the system has a Translation Lookaside Buffer (TLB) that can cache the mapping of 32 most recently referred virtual pages. Assume that a TLB lookup needs 100ns.

What would be the TLB hit ratio that will ensure an average address translation time of 200ns?