This question considers the basic MIPS 5-stage pipeline (F, D, EX, M, WB).

Show how the instructions in the sequence given below will proceed through the pipeline:

Predict the the beq instruction is not taken

When the beq instruction is executed, the value in $1 is equal to the value in $2

beq $1, $2, FINAL # i1

lw $10, 0($11) # i2

sub $14, $10, $10 # i3

FINAL: add $4, $1, $2 # i4

(For this problem, you may assume that there is full forwarding hardware support.)

A.	1	2	3	4	5	6	7	8	9
i1	F	D
i2		F
i3			F
i4				F	D	E	M	W

B.	1	2	3	4	5	6	7	8	9
i1	F	D	E	M
i2		F	D	E
i3			F	D	E	M
i4				F	D	E	M	W

C.

	1	2	3	4	5	6	7	8	9
i1	F	D	E
i2		F	D
i3			F
i4				F	D	E	M	W

D.	1	2	3	4	5	6	7	8	9
i1	F	D	E	M	W
i2		F	D	D	D	E	M	W
i3			F	D	E	M	W
i4				F	D	E	M	W