Consider an instruction pipeline with five stages: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO), with 6 ms to execute each stage.

A program consisting of 12 instructions (e.g. I1, I2 ... I12) is executed in this pipelined processor.

i. Calculate the time (in ms) needed to complete this program without pipelining. ii. Calculate the speedup factor for the instruction pipeline compared to the execution without pipeline. iii. Instruction 4 (i.e. I4) is the only branch instruction and its branch target is Instruction 9 (i.e. I9). If the branch is taken during the execution of this program, draw the 5-stage pipelining.