Suppose you have a computer with a main memory that is word-addressable and has a size of 32K x 16. The assembly program's instruction set consists of 400 different operations. All instructions have an operation code part (opcode) and an address part, allowing for only one address. Each instruction is stored in one word of memory. a. Determine the number of bits needed for the opcode. b. Calculate the number of bits available for the address part of the instruction. c. Find out how many additional instructions could be added to this instruction set without exceeding the assigned number of bits. Discuss and show your calculations. d. Determine the largest unsigned binary number that the address can hold.

Suppose you have a computer with a main memory that is word-addressable and has a size of 32K x 16. The assembly program's instruction set consists of 400 different operations. All instructions have an operation code part (opcode) and an address part, allowing for only one address. Each instruction is stored in one word of memory. a. Determine the number of bits needed for the opcode. b. Calculate the number of bits available for the address part of the instruction. c. Find out how many additional instructions could be added to this instruction set without exceeding the assigned number of bits. Discuss and show your calculations. d. Determine the largest unsigned binary number that the address can hold.