Q2. Inspect the code below and answer the following questions? Find all data dependencies in the code below. Execute the following code on a 5-stage pipelined datapath without forwarding and with forwarding. How many clock cycles does this code take without forwarding and with forwarding? Can you do code scheduling to remove all stalls? Iw $t1,0($t0) Iw $t2, 4($t0) add $t4, $t1, $t2 Iw $t3, 8($t0) sub $t6, $t3, $t7