For Problems 1 & 2, reference the following piece of assembly code pos1 negl count 4 done nor 1 loop beq e nor 3 nor 4 beq e add 6 beq e even add 7 else add 3 beq e //beqe even //beq1 else //beq2 loop //beq3 done halt count .fill 4 posi .fill 1 negi .fill 1 Problem 1: Out of Control a) Write the sequence of branch decisions for each beq instruction. Let "taken" be denoted as "T" and "not taken" as "N". For example, a beq that is taken twice and then not taken once would have a sequence TTN. The global sequence will be the for all branch instructions put together. For example, if beqo executes as N, then beq1 as T, then beq0 as N, we would have a sequence NTN beq0 beq1 beq2 beq3 Global