Base your answers to parts a) and b) below on the following version of the MIPS pipeline:

a) (3) What is the earliest stage in which a BHT (branch history table) can be consulted to predict the behavior of a conditional branch instruction?

b) (3) What is the earliest stage in which a DHT (decode history table) can be consulted to predict the behavior of a conditional branch instruction?

c) (3) Suppose the system employs delayed branching and uses a BHT to predict the behavior of conditional branch instructions. How many instructions have to be flushed from the pipeline for each incorrect branch prediction?

d) (3) Suppose the system does not employ delayed branching and uses a DHT instead of a BHT to predict the behavior of conditional branch instructions. How many instructions have to be flushed from the pipeline for each incorrect branch prediction in this case?