Consider the following simple program executed on a pipelined MIPS CPU LOOP: addi $s0, $zero, 3 lw $t0, 0($s1) add $t1, $t0, $t2 add $t3, $t1, $tt4 addi $s0, $s0, -1 bne $s0, $zero, LOOP addi $s1, $zero, $zero a) How many cycles will be required for the program to fully execute on a 5 stage pipeline with forwarding and perfect branch prediction? b) How many cycles will be required for the program to fully execute on a 5 stage pipeline that has no forwarding or branch prediction, but automatically inserts a minimal number of stalls