Urgent!!!

Assume a pipelined processor with five pipeline stages where each stage takes one clock cycle. Further, assume that the processor has to execute the following instruction sequence ADD $t0, $T1, $T3 ADDI $51, $51, 4 LW $50, 0($51) SUB $55, $50, $TO AND $13, $T4, $55 SW $55, ($51) MULT $52, $56, $13 SUB $T6, $17, $56 How many stalls (in terms of the number of stall clock cycles) will the processor experience if it does not have any forwarding unit to reduce or eliminate pipeline stalls? (Assume that the write back step of an earlier instruction and the instruction decode step of a subsequent dependent instruction can happen in the same clock cycle). Calculate the total number of clock cycles needed to complete executing the instruction sequence. If the processor has a forwarding unit to reduce different kinds of data hazards, what would be the total number of stall cycles to execute the same instruction sequence? If the manufacturer does not upgrade the processor to have a forwarding unit, but an optimizing compiler reduces hazards by altering the instruction sequence, what will be the minimal number of stall cycles