Consider the following code sequence below. Lw $t0, 0 ($t0) Add $t1, $t0, $t2 Without using any forwarding, how many NOP instructions do we need to eliminate all the data hazards and stalls. What kind of forwarding path do we need to minimize the number of NOP instructions needed to avoid all the data hazards and stalls. A: ALU-ALU forwardingB: MEM-ALU forwardingC: NO forwarding needed B (Fill in either A, B or C)How many stalls do we still have after adding the forwarding path if any