We have a program core consisting of five conditional branches. the program core will be executed thousands of times. below are the outcomes of each branch for one execution of the program core (t for taken, n for not taken) branch 1: t-t-t branch 2: n-n-n-n branch 3: t-n-t-n-t-n branch 4: t-t-t-n-t branch 5: t-t-n-t-t-n-t assume the behavior of each branch remains the same for each program core execution. for dynamic schemes, assume each branch has its own prediction buffer and each buffer is initialized to the same state before each execution. list the predictions for the following branch prediction schemes: a. always taken b. always not takern c. 1-bit predictor, initialized to predict taken d. 2-bit predictor, initialized to weakly predict taken what are the prediction accuracies?