8. (10 points) Consider the following instructions a lw $r0, 4 ( $sp) b addi $r1, $rO, 3 c addi $r2, $r1, 9 d lw $r3, 8 ( $r2) e lw $r4, 12 ($r1) f mult $r5, $r4, $r1 g addi $r6, Sr4, 2 h mult $r7, $r5, $r6 i add $r8, $r3, $r7 Draw the dependence graph, using the same form as the previous problem. Each node in the graph should include the instruction's delay and path delay (number of cycles to execute that path to com- pletion). Loads and stores take 3 cycles, adds take 1 and multiplies take 2 cycles