1. Consider the following program: 11 12 13 14 15 16 17 (R1 = R2) goto X // goto is jump instruction that branches to the label X R10 = [R11] R14 R10 R10 X: R4 R1+R2 R1 = [R4] R2 R3 - R5 R1 R1 + R10 Instruction = 5 stages. Stage = 6ns. Pipelining is implemented using prediction. The prediction is that R1 # R2. However, when the program is executed, R1 = R2. a. Draw the pipelining diagram for the program. Justify briefly your decisions b. Find the total time of execution after pipelining in a c. Redraw the pipelining diagram for the program when the prediction is correct. Justify briefly your decisions d. Find the total time of execution after pipelining in c e. Find the percentage saving in the case when the prediction is correct