Consider below code sequence: add $te,$s2, $s1 sub $t1, $s1, $s2 add Ste, St1, $te lw $t3, 16($s53) addi $t3, St3, 1 How many clock cycles would be required to execute the above code sequence if single-cycle datapath is used? 25 25 How many clock cycles would be required to execute the above code sequence if ideal pipelining is used? 9. 9. How many clock cycles would be required to execute the above code sequence if only stalling is used to avoid hazards? 12 12 How many clock cycles would be required to execute the above code sequence if stalling and forwarding is used to avoid hazards? 10 10 How many clock cycles would be required to execute the above code sequence if stalling, forwarding, and code scheduling is used to avoid hazards? 9.