This is for CDA3101 - Introduction to computer organization.

Please try to type your answer - handwriting can be very hard to read.

I am looking for you to answer problem 4. Problem 3 is for reference.

Thank you for your help!

Below is Problem 3 (referenced above):

Thank you!

4. [10 points] This question is about pipeline scheduling. Show the optimal pipeline schedule for the three-instruction MIPS program in Problem 3. Assume there is forwarding. Use MIPS stages IF, ID, EX, MEM, WB as in the lecture notes. Label a stall as "ST". Use arrows for forwarding, which may occur from the EX or MEM stage to any stage of a subsequent instruction nstructioniclock cycle cc0 cc1 CC 7 lw $to, 24($s0) w $t2, 28($s0 add $t2, $t2, $to