loop: lw r1,4(r7) lw r2,8(r7) lw r3,12(r7) add r1,r1,r3 sw r1,4(r7) bne r1,r2,loop

Assume this loop executes 10 times: 1. How many clock cycles with pipelining, but without branch prediction? (Draw full diagram) 2. How many clock cycles with pipelining, and the prediction: BRANCH NOT TAKEN? (Draw full diagram) 3. Rewrite the code so that the prediction in the previous item yields a more efficient pipeline. (Rewrite so that the branch happens at the top)