Consider the following sequence of instructions executed on the five-stage pipelined processor:
LW $1, 30($6)
ADD $2, $4, $2
ADD $1, $3, $5
SW $2, 20($4)
ADD $1, $1, $4
Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?