his question analyzes the following array sum function, whose first argument is a pointer to an array of

integers and whose second argument is the length of the array.

add$1$: add $v$0,$ $$0,$ $$0$

beq$1$: beq $a$1,$ $$0,$ jr$1$

addi$1$: addi $a$1,$ $a$1,-1$

lw$1$: lw $t$0,0($$a$0)$

add$2$: add $v$0,$ $v$0,$ $t$0$

addi$2$: addi $a$0,$ $a$0,4$

beq$2$: beq $$0,$ $$0,$ beq$1$

jr$1$: jr $ra

$($a$)$ List the data addresses referenced by this function when called on an array of length three, starting

at address A$.$

$($b$)$ List the instruction address $($i$.$e$.,$ PC$)$ references that same function call makes, assuming add$1$ is

at address P$.$

What is the hit rate of this call on an L$1$ data cache that is $256$B$,$ direct mapped, with $16$B lines?

Assume that A $=0$x$0000$EFA$0.$