I need help with this:

$5\mathrm{.}11$ This exercise examines the effect of different cache designs,

specifically comparing associative caches to the direct$-$mapped

caches from Section $5\mathrm{.}4.$ For these exercises, refer to the sequence

of word address shown below.

$0$x$03,0$xb$4,0$x$2$b$,0$x$02,0$xbe, $0$x$58,0$xbf$,0$x$0$e$,0$x$1$f$,0$xb$5,$

$0$xbf$,$ Oxba, $0$x$2$e$,$ Oxce

$5\mathrm{.}11\mathrm{.}1[10]$ $$5\mathrm{.}4>$ Sketch the organization of a three$-$way set

associative cache with two$-$word blocks and a total size of $48$

words. Your sketch should have a style similar to Figure $5\mathrm{.}18,$

but clearly show the width of the tag and data fields.

$5\mathrm{.}11\mathrm{.}2[10]$$$5\mathrm{.}4>$ Trace the behavior of the cache from Exercise

$5\mathrm{.}11\mathrm{.}1.$ Assume a true LRU replacement policy. For each

reference, identify

the binary word address,

the tag,

the index,

the offset

whether the reference is a hit or a miss, and

which tags are in each way of the cache after the reference has

been handled.

Sketch the organization of a fully associative

cache with one$-$word blocks and a total size of eight words.

Your sketch should have a style similar to Figure $5\mathrm{.}18,$ but

clearly show the width of the tag and data fields.

$5\mathrm{.}11\mathrm{.}4[10]$ $$5\mathrm{.}4>$ Trace the behavior of the cache from Exercise

$5\mathrm{.}11\mathrm{.}3.$ Assume a true LRU replacement policy. For each

reference, identify

the binary word address,

the tag,

the index,

the offset,

whether the reference is a hit or a miss, and

the contents of the cache after each reference has been

handled.

$5\mathrm{.}11\mathrm{.}5[5]$$$5\mathrm{.}4>$ Sketch the organization of a fully associative

cache with two$-$word blocks and a total size of eight words.

Your sketch should have a style similar to Figure $5\mathrm{.}18,$ but

clearly show the width of the tag and data fields.

$5\mathrm{.}11\mathrm{.}6[10]$ $$5\mathrm{.}4>$ Trace the behavior of the cache from Exercise

$5\mathrm{.}11\mathrm{.}5.$ Assume an LRU replacement policy. For each reference,

identify

the binary word address,

the tag,

the index,

the offset,

whether the reference is a hit or a miss, and

the contents of the cache after each reference has been

handled.

$5\mathrm{.}11\mathrm{.}7[10]$ $$5\mathrm{.}4>$ Repeat Exercise $5\mathrm{.}11\mathrm{.}6$ using MRU $($most recently

used$)$ replacement.

$5\mathrm{.}11\mathrm{.}8[15]$ $$5\mathrm{.}4>$ Repeat Exercise $5\mathrm{.}11\mathrm{.}6$ using the optimal

replacement policy $($i$.$e$.,$ the one that gives the lowest miss

rate$).$