Consider the following MIPS code. Assume the instructions before and after are all NOP $($i$.$e$.$ no operations$).$ The code is executed in a pipeline where there is NO forwarding and branch outcome is known at the end of EX stage. There is no branch prediction $($i$.$e$.$ the pipeline has to stall for each beq instruction$).$

List all the cycle numbers from least to largest in which an instruction is finished. Separate them by commas.

Specify the instructions in the pipeline at the end of $16-$th cycle by showing the instruction number in each stage starting with IF$.$ The first instruction has index $1.$ If the pipeline has been stalled, some stages may have "NOP". Separate the answers with commas. An answer for this part would look like $"1,2,3,4,5"($no stall$/$brach$/$jump$)$ or $"2,3,$NOP,$4,5"($a stall occured$)$ or $"5,6,9,19,11"($a branch or jump occured$).$

Separate the two answer parts by a semicolon.

$1$: and $t$2,$ $t$5,$ $t$1$

$2$: sw $t$1,-16($$t$4)$

$3$: sw $t$4,32($$t$2)$

$4$: sub $t$4,$ $t$2,$ $t$3$

$5$: beq $t$3,$ $t$4,3$ # This branch is taken.

$6$: sw $t$4,-8($$t$1)$

$7$: sub $t$2,$ $t$2,$ $t$4$

$8$: and $t$4,$ $t$2,$ $t$2$

$9$: add $t$2,$ $t$2,$ $t$1$

$10$: and $t$4,$ $t$5,$ $t$4$

$11$: sw $t$5,-56($$t$2)$

$12$: and $t$4,$ $t$2,$ $t$2$

$13$: sw $t$2,68($$t$1)$

$14$: slt $t$3,$ $t$3,$ $t$4$

$15$: or $t$1,$ $t$3,$ $t$3$