The process will execute following instruction. It uses LRU $($Least Recently Used$)$ b$)$ Now we transpose array $b$ so the code is modified to:

$c[i][j]=c[i][j]+a[i][k]*b[j][k]$;

Fill the following access pattern table with the same assumptions as a$).$

replacement policy.

#$1$: Load byte $0$x$11$EDA$206//00010001111011011010001000000110$

#$2$ : Load byte $0$x$50$EDA$203//01010000111011011010001000000011$

#$3$: Load byte $0$x$51$ADA$23$C $//01010001101011011010001000111100$

#$4$: Load byte $0$x$51$FDA$203//01010001111111011010001000000011$

a$)$ Select the answer between hit $/$ miss

Instruction #$1$ will $($hit $/$ miss$)$

Instruction #$2$ will $($hit $/$ miss$)$

b$)$ What is the return value $($byte$)$ of instruction #$3?$

c$)$ Fill up the tag array of set ID $32$ after the process executes instruction #$4.$ You also should

write the old$/$new of each entry.