$2\mathrm{.}2$ A program consists of two nested loops, with asingle branch instruction at the end of each loop andno other branch anywhere. The outer loop is executed$50$ times and the inner loop $50$ times. Determine theaccuracy of the following three branch predictionstrategies: $($a$)$ always predict not taken. $($b$)$ use $1$ bitof history and the initial prediction is not taken, $($c$)$ use$2$ bits of history assuming that the predictor starts offin the bottom right state from predict not takenwith not taken self loop $(6$ points