6. Which of the following statements are true for dynamic branch prediction?
(A)Branch history table or branch prediction buffer can be implemented as a memoryindexed by the lower bits of the program counter address.
(B) Branch prediction buffer must have tag and address check.
(C)A 2-bit dynamic branch predictor must miss twice before the prediction is changed.
(D)Mis-prediction can be caused by getting the branch history of wrong branch whenindexing the branch history table.
(E) Correlating branch predictors assume that the behaviour of a branch would not beaffected by the behaviours of other branches.