a) Consider a processor implemented as a six stage pipeline. Suppose that the pipeline is initially empty, what is the number of cycles required to perform a sequence of 40 instructions that do not include any branching instructions? Also, what is the average cycles per instruction (CPI) for this given scenario?

b) Reconsider part a. Suppose that instead, one in 10 of the instructions is a branch instruction and that each branch introduces a penalty of four cycles. For this new scenario calculate the number of cycles required to perform the instructions and the average cycles per instruction (CPI) for this given scenario.

c) Reconsider the part a & b. Suppose the pipeline handles a dependency between calculations by stalling the pipeline for one cycle. Suppose on average one instruction in twenty has a data dependency. For this new scenario calculate the number of cycles required to perform the instructions along with the branches from exercise 2 as well as data dependencies, then calculate the average cycles per instruction (CPI) for this given scenario.