What is the memory access time penalty associated with page table walking and how does a transition look$-$aside buffer $($TLB$)$ decrease the memory access time? How does the property of locality effect the operation of a TLB and what hit rate would you expect for a typical TLB with $64$ entries?