Note: END is an assembly directive, not an instruction and should not be counted as an instruction.

a$)$ How many cycles does this program take? Assume all data and instructions are already in the cache, and that all register values are initially $0.$ The branches are always going to

be evaluated as not taken and they require two stall clock cycles each.

b$)$ An optimizing compiler is used to re$-$order the code for faster execution. Given that the branches are always going to be "not taken", how would the new code look like? How

many cycles would the code take?