Show how the same four instructions move through each stage of the five stage pipeline, similar to the example on slide 13 of lecture 17. This pipeline does support bypassing. Make sure the decode stage does not advance an instruction through the pipeline unless all data dependences are correctly resolved. You don't need to show the latch involved in every bypass (but feel free to ponder this question for your own understanding). (25 points) I1: add $s1, $s2, $s3 I2: lw $s4, 4($s4) I3: add $s5, $s4, $s1 I4: sw $s5, 8($s2)

please no hand writing