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 F|DX|MW 8 9 10 11 12 slt Sto, Sta, $tb bne $to, Szero, L add Stc, Sta, Szero j exit L add Stc, Stb, Szero exit predict not taken-b>a 7 | 8 | 9 | 10 | 11 | 12 1 | 2 | 3 4 5 6 FDXMW slt Sto, Sta, stb bne $to, Szero, L add $tc, Sta, Szero j exit L add $tc, Stb, Szero exit