4. (8 points) The following is the MIPS code for computing the max(a,b) as in the slides in chapter 2. Assume a static predict branch not taken strategy with forwarding in the pipeline. Show the schedule for both a > b and b> a. predict not taken - ab 1 2 3 4 5 6 7 8 9 10 11 12 sit $to, $ta, $tb F D M W bne $to, $zero, L add $tc, $ta, $zero j exit L add $tc, $tb, $zero exit predict not taken-b>a 1 2 3 4 5 6 7 8 9 10 11 12 slt $to, $ta, $tb F D X M w bne $to, $zero, L add $tc, $ta, Szero j exit L add $tc, $tb, $zero exit