Consider the following sequence of instructions executed on the five-stage pipelined processor:
I1: lw $1, 40($6)
I2: add $2, $3, $1
I3: add $1, $2, $6
I4: sw $2, 20($4)
I5 : and $1, $1, $4
Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?