About the branch prediction, which of the following statements are True$/$False$?$ And give

the reasons for each answer.

$($a$)(4\%)$ For a one$-$bit dynamic branch predictor, the branch prediction buffer contains one bit

to record whether the branch instruction was recently taken or not.

$($b$)(4\%)$ A branch prediction buffer is a small special$-$purpose memory indexed by the higher$-$

order bits of the address of the branch instruction.

$($c$)(4\%)$ For a two$-$bit dynamic branch predictor, and initial state is a strong predicton not taken,

a prediction must be wrong twice before it is changed.

$($d$)(4\%)$ The assumption of dynamic branch prediction is that the underlying algorithms and

the data that is being operated on have regularities.

$($e$)(4\%)$ If the delay branch slots can be scheduled with independent instructions from before

the branch, branch hazards can be avoided.