Problem $3(20$ points$).$ Suppose your code contains a beq instruction in a loop which results in the following branch outcomes: T$,$ NT$,$ NT$,$ NT$,$ NT$,$ T$,$ NT$,$ T$,$ NT$,$ T$,$ where T means taken and NT means not taken. $($a$)$ What is the accuracy of a static branch predictor that always predicts that the branch is not taken? $($b$)$ What will be the accuracy of a $1-$bit branch predictor, assuming it starts with a T prediction? $($c$)$ What will be the accuracy of a two$-$bit predictor assuming that the predictor starts off in the strongly taken state?