Consider an instruction set for a hypothetical computer with 32-bit instructions and 32 registers Assume that instructions come in three types A, B, and C: Type A: Type B: Type C:35 instructions with 2 register operands 40 instructions with 3 register operands 6 instructions with 2 register and 1 x-bit immediate operands. In all questions below, please solve for x in different cases. You do not need to specify the exact format you choose in each part. (2 +3 +2-7 points) (a) If the opcode field of all instructions is of equal length, then what is the maximum value of x possible in such a format? (b) If expanding opcodes are used, then what is the maximum possible value of x among all possible encodings of the instruction set? (c) Suppose for pipeline efficiency it is imperative that expanding opcodes be used only in the following way: first, a fixed-length field distinguishes the three instruction types, and then the remaining bits contain more opcode bits to distinguish instructions within a type. In this type of encoding, what is the maximum value of x