Consider the following sequence of instructions:

(I1) beq $9, $10, EXIT

(I2) add $9, $11, $12

(I3) lw $16, 12($9)

(I4) sw $16, 16($19)

(I5) sw $18, 0($11)

(I6) add $4, $0, $0

(I7) add $5, $0, $0

Assume the following:

There are no stalls in the code above

5 stage pipeline (IF, ID, EX, MEM, WB) is available

Stages IF, ID, and EX take 100 ps, MEM takes 300 ps, and WB takes 150 ps.

Each instruction executes every stage.

No branch stalls.

Compute the total time needed to execute the code with and without the pipeline.