1.2 Suppose we use 9 bits to represent numbers in 2's complement form. (1) What's the binary form of decimal value 19 ? (2) What's the decimal value of the binary number 110101001? [2 pts] 1.3 Suppose that we use 4 bits to represent integers in 2's complement form. Consider the following two cases of binary addition. First, calculate the result. Second, decide whether there is overflow and explain why. [2 pts] 1) Case 1: 0111+1111 2) Case 2:1110+1000 1.4 Consider two memory addresses A=000000042 and B=000FA0700. Which address(es) can be used as the address for an instruction? Why? [2 pts] 1.5 Using Boolean algebra to simplify this function f=xy+xy+xy such that the result is a sum of two terms and each term contains a single variable or its complement (e.g., x or x ). Show the steps. [2 pts]