$3.$ Consider a system that implements virtual memory and uses a page table to track the mapping of virtual addresses to physical addresses. The following is an accessing sequence of virtual byte addresses as seen on the system.

Addresses: $\backslash (0$ x $0123\backslash$mathrm$\{$~d$\},0\backslash$mathrm$\{$x$\}0083\backslash$mathrm$\{$~b$\},0$ x $0365\backslash$mathrm$\{$c$\},0\backslash$mathrm$\{$x$\}0871\backslash$mathrm$\{$~b$\},0\backslash$mathrm$\{$x$\}0\backslash$mathrm$\{$bee$\}6,0\backslash$times $03140,0\backslash$times $0$ c $049\backslash )$

Assume $4-$kilobyte memory pages, a four$-$entry fully associative TLB$,$ and a true LRU replacement policy.

TLB

If memory pages must be brought in from the disk, the disk data is placed into a new physical page. The new physical page is identified by the increment of the current largest page number by one. The current largest page number is $12.$

Page Table

For each access of the seven addresses listed about, answer the following

$-$ Whether the access is a hit or miss in the TLB$?$

$-$ Whether the access is a hit or miss in the page table?

$-$ Whether the access is a page fault?

$-$ What is the updated state of the TLB$?$