COMPUTER ARCHITECT

I need help to answer and explain this Thanks

for (1-0; 11000; 1++) if ( (i mod 2)=-0) /7 Do some stuff, no branches here a) The code results in at least two conditional branches. Using a one-bit predictor for branch prediction, what is the prediction accuracy for the loop and for the if statement? Assume the initial prediction is to take the branch b) Using the two-bit predictor shown by the finite state automaton below, what is the prediction accuracy for the loop and the if statement? Assume you start in state 00.] NT 01 Predict taken Predict taken 10 Predict not taken Predict not taken NT NT c) Would a correlation predictor help in this case? for (1-0; 11000; 1++) if ( (i mod 2)=-0) /7 Do some stuff, no branches here a) The code results in at least two conditional branches. Using a one-bit predictor for branch prediction, what is the prediction accuracy for the loop and for the if statement? Assume the initial prediction is to take the branch b) Using the two-bit predictor shown by the finite state automaton below, what is the prediction accuracy for the loop and the if statement? Assume you start in state 00.] NT 01 Predict taken Predict taken 10 Predict not taken Predict not taken NT NT c) Would a correlation predictor help in this case