Consider the following assembly language program. add $5, $0, $0 1w $1, 40($6)/* assume Mem[40 + R[$6] = 5 */loop: addi $1, $1, -1 add $5, $5, $1 add $6, $5, $0 sw $1, 20($6) bne $1, $0, nop nop a) Assume that the code is executed on a non-pipelined CPU, with each instruction taking 5 clock cycles. What is the total execution time in clock cycles? b) Assume that the code is executed on our 5 stage pipeline with no forwarding. You will have to stall, or insert nops to resolve dependencies. What is the total execution time in clock cycles? c) Assume that the code is executed on our 5 stage pipeline with forwarding. What is the total execution time in clock cycles