$18-18$ you are provided with a snapshot of a $4$entries, fully associative TL$\mathrm{.}8$ and a pege table, The TLB uses a least recently used replacement policy The page size is $4kB.$ If needed, you may assume that the value of the page table register is $0,-$ Note: ${11}^{\text{'}}=$ Most Recently Used and $\text{'}4\text{'}=$ Least Recendly Used, update final state of the TL$.$B after processing the $2$ virtual address sequence given below:

$($MSB$)1011000000010010($LSB$)($this is a load instruction$)$

$($MSB$)1011110111101111($LSB$)($this is a storeinstruction$)$

$\backslash$table$[[$Valid$,$Dirty,$($R$),,$Whywatpiget?$],[1,,3.,0\mathrm{.}10,1000],[3,$O$.,4,0011,1101],[$f$,0,2,1000,0910],[1.,0,1,$vixd,$1010]]$

The LRU value for the first entry is:

A$.1$

B$.2$

$-$C$.3$

D$.4$

E$.$ None

$\backslash$table$[[$Address:$,$Valid,Physicar page it$],[0090,,1410],[0001,0,$Disk$],[020,1,1100],[0011,1.,1101],[$orea$,1.,2010],[0101.,1.,1011],[0110,1,1000],[0111,1,1004],[1000,1,$onso$],[1001,1.,$o$111],[1020,1,0100],[1011,0.,$Disk$],[1100,0,$Disk:$],[1101,1,],[+,$thans,nethe$],[,$macesties,$]]$