Assume the following:

The memory is byte addressable.

Memory accesses are to $1-$byte words $($not to $4-$byte words$).$

Virtual addresses are $14$ bits wide.

Physical addresses are $13$ bits wide.

The page size is $256$ bytes.

The TLB is $4-$way associative tlb $(E=4$ with $1$ sets $(S=1)$ and a total of $4$ entries $.$

The TLB and a portion of the page table contents are as shown below

Assume that memory address $0$ xc$06$ has been referenced by a load instruction. Determine the virtual page number $($VPN$)$ and use that to compute the TLB index

and tag that would be used to check the TLB for the translation entry. Indicate if the entry is in the TLB $($Y$/$N$).$

Indicate if the memory reference has a valid entry in the page table whether it hits in the TLB or not.

Use the information from the page table to translate the VPN to a physical page number $($PPN$)$ and then the valid physical address $($PA$).$

For entries that can not be determined $($ e$.$g$.$ the PPN or PA if a translation doesn't exist$),$ enter $"-".$