a) Consider a hypothetical four stage processor where the stages are defined as: s1, s2, s3, s4. Each stage requires 1 cycle to complete. Suppose a program consisting of 100 instructions, is executed on this 4-stage processor. i) ii) Draw the timing diagram showing the execution of the first four instructions, considering that the program is running on without pipelining. [4 marks] Draw the timing diagram showing the execution of the first four instructions, considering that the program is running with ideal pipelining. Assume that there is no pipeline hazards and dependencies. [4 marks] Compute the execution time of the program without pipelining and with pipelining (no dependencies), and compare the performance improvement for ideal pipelining. [4 marks) iii)