$[$b$]$ Consider a $4-$stage instruction pipeline and four instructions need to be

executed on the pipelined processor. The instructions consume different

number of clock cycles at different stages as shown below:

The following code has to be executed on the pipelined processor:

I$1$ instruction is first executed followed by $12,13$ and $14,$ and the process repeats $100$

limes$.$ After how many clock cycles the output of the instruction $12$ for $j=2$ will be

available?