A computer uses instruction pipelining with P=4 stages named FD, DO, EX, WO. Each stage takes T seconds to perform its...

A computer uses instruction pipelining with P=4 stages named FD, DO, EX, WO.
Each stage takes T seconds to perform its task. Suppose you have N=9 instructions in
your program which has a branch from instruction 4 to 8. Draw a figure to show what
happens over time as each instruction is processed. Indicate the branch penalty.