do question no d

b) Suppose you have now implemented basic pipelining in this processor. Consider the following piece of code. add $50, $so, $t1 sub $50, $so, $t2 lw $51, 20($t3) add $s2, $s1, $50 A friend of yours explains the following about the execution time of this code: "The clock cycle time of the pipelined processor will be 50 ps, since this is the minimum time taken by any individual stage. The first instruction will require six clock cycles, and every following instruction will require one additional cycle. The total number of clock cycles will therefore be 6+1+1+ 1 = 9. The execution time of this code will therefore be 9*50 = 450 ps." You are worried your friend may not pass their final examination. Explain why your friend is wrong. In your answer, clearly mention the reasons that your friend is wrong, along with the correct values of the clock cycle time of the processor, the number of clock cycles required for the given code to execute, and the total time taken for this code. Include a timing diagram/s as well. c) Suppose you have now implemented bypassing in your pipelined processor. State and explain the modified time required for the code in part (b) to execute. You should include a timing diagram in your answer. d) Explain how the execution time of the code in (b) can be improved further after bypassing has been implemented