F = P.SP.Q.S + P.Q.S G = F.P + R.P + (P+S). (P + Q). R Note that G is a function of F, which is given by the first equation. Finally, simplify: H = F. G

Write, and test using spim, an assembly language program that inputs acharacter string from the user (you can assume that the string will be at most 20characters, not including the zero byte delimiter), forms a new string that contains thecharacters of the input string, but in reverse order, and then outputs the new string.

For the following question, you need to create a truth table, write the Boolean expression for each output based on the truth table, use K-map to simplify the expression if possible, and draw the logic diagram using AND, OR, NOT gate only. 1. Design a 3-bit shifter. a. A0, A1, A2, and S as inputs b. If S=0, then shift one bit to the left and add 0 to the last bit c. If S=1, then shift one bit to the right and add 0 to the first bit d. Y0, Y1, and Y2 as outputs