Question 1: Pipelining (43) Assume a processor that implements five stage pipelining where each stage takes 4ns Consider the following program: If (RO == R2) {RO = RO+ R1) else (R3 = R2 + R3) R4 = RO + R6 R5 = R3 + R1 Assume R1 = R2. a. Compute the total time needed for sequential execution (no pipelining). (5 points) b. Complete the pipelining diagram for the program where forwarding is not allowed. Justify briefly your decisions. (25 points) c. Find the total time of execution after pipelining (8 points) d. Find the saving percentage due to pipelining (5 points). Question 2: Memory (26 points) You need to design a memory of 256 x 16. You can use 32 x 8 blocks or 64 x 4 blocks only. You cannot mix the two sizes. a. Which option is better? Justify (6 points) b. Design the 256 x 16 memory using the best option and draw the block diagram. (20 points)