Problem 1: Given the following code lw $t1, 0($s1) add $t0, $t0, $t1 1. Identify all of the data dependencies in the code 2. Execute the code on a pipelined computer by filling in the slots of a table similar to the following one, where each row represents an instruction and each column represents a clock cycle. Assuming forwarding is not available, insert stalls where they are necessary and calculate the total clock cycles Instruction 1 23 lwSt0.0(Ss0) | IF | ID | EX | MEM | WB IF | ID | EX | MEM | WB 3. Do 2. again, this time assuming forwarding is available Problem 1: Given the following code lw $t1, 0($s1) add $t0, $t0, $t1 1. Identify all of the data dependencies in the code 2. Execute the code on a pipelined computer by filling in the slots of a table similar to the following one, where each row represents an instruction and each column represents a clock cycle. Assuming forwarding is not available, insert stalls where they are necessary and calculate the total clock cycles Instruction 1 23 lwSt0.0(Ss0) | IF | ID | EX | MEM | WB IF | ID | EX | MEM | WB 3. Do 2. again, this time assuming forwarding is available