Problem $3(20$ pts$)$: For a deeper pipeline, such as that in MIPS R$4000,$ it takes three pipeline stages before the branch target address is known and an additional cycle before the branch condition is evaluated $($taken or not taken$)($i$.$e$.$ the branch target address is calculated at stage $3$ and branch result is evaluated at stage $4).$ Assume no stalls on the registers in the conditional comparison.

Fill in the table for the number of cycles of penalty for the three static branch approaches. Note: if what you have fetched is correct, you do not need to repeat the instruction fetch.

$\backslash$table$[[$Strategy$,\backslash$table$[[$Unconditional$],[$Branch$]],\backslash$table$[[$Conditional Branch$],[-$ Taken$]],\backslash$table$[[$Conditional Branch$],[-$ Untaken$]]],[\backslash$table$[[$Stall the pipeline$],[$until the branch is resolved$]],,,],[$Predict taken,,,$],[$Predict untaken,,,$]]$