Multi$-$Cycle Arch. Given the following code. Assume that x and y are arrays of words and the base address of x is stored in R$1$ and the base address of y is stored in R$2.$ Assume that each add operation takes $3$ cycles to execute, each lw operation $4$ cycles, each store sw takes $3$ cycles, and each branch $($bne$)$ instruction takes $2$ cycles to execute. The $$T$$ represents Temp registers. All numbers are in decimal.

add T$0,$ zero, zero # T$0=$ i $=0+0=0$

add T$1,$ R$1,$ zero # T$1=$ address of x$[$i$]+0$

add T$2,$ R$2,$ zero # T$2=$ address of y$[$i$]+0$

add T$3,$ zero, $101$

Loop: lw T$4,0($T$2)$ # Load T$4$ with M$[$T$2+0]$ value

add T$5,$ T$4,$ C # C is a constant value

sw T$5,0($T$1)$ # Store T$5$ to M$[$T$1+0]$

add T$0,$ T$0,1$

add T$1,$ T$1,4$

add T$2,$ T$2,4$

$142$: bne T$0,$ T$3,-7$ # Loops if branch is taken

$144$: add T$0,$ T$0,200$

What is the PC value for the SW instruction?

Multiple choice $1$ Question $2$

$120$

$128$

$124$

$134$

Calculate the branch target address?

Multiple choice $2$ Question $2$

$130$

$-7$

$116$

$133$

What happens after T$0$ becomes equal to T$3?$

Multiple choice $3$ Question $2$

T$0$ increases by $100$

Branch is taken

T$4$ is loaded with new value from memory

T$0$ increases by $200$

What is the total number of instructions that get fully executed?

Multiple choice $4$ Question $2$

$101$

$12$

$144$

$1412$

How many cycles it take to execute all instructions in the given code?

Multiple choice $5$ Question $2$

$2136$

$36$

$24$

$576$

What is the final value of T$0?$

Multiple choice $6$ Question $2$

$194$

$301$

$201$

$200$