Given the following MIPS code:

L_1: lw $s2, 24($s0)

L_2: lw $s3, 40($s0)

L_3: add $s2, $s3, $s2

L_4: subi $s2, $s2, 27

L_5: sw $s2, 64($s0)

Draw the OPTIMIZED pipeline schedule for the above code, using the MIPS pipeline IF-ID-EX-MEM-WB that we discussed in class.

SHOW ALL FORWADING PATHS ( FROM EX or MEM) <<<