CHAPTER 3 Algorithm Development in Pseudocode 3.2 Analyze the assembly language code that you developed for each of the above pseudocode expressions and calculate the number of clock cycles required to fetch and execute the code corresponding to each expression. Assume it takes one clock cycle to fetch and execute every instruction except multiply, which requires 32 clock cycles divide, which requires 38 clock cycles, and syscall instructions, which will require a fixed overhead, oh, plus a per character time of 6 clock cycles. User input time can be included as ui. 3.3 Show how the following expression can be evaluated in MIPS assembly language, with- out modifying the contents of the "s" registers: tO = (s1 - s0/s2) * s4 ; 3.4 Show how the following pseudocode expression can be efficiently evaluated (meaning fewest clock cycles) in MIPS assembly language. Assume normal operator precedence