The numbers given in hexadecimal below are eight bits each and represent numbers that use two's complement. (The hexadecimal number ff, for example, would be equivalent to 11111111 in binary or -1 in decimal according to the rules of two's complement. The hexadecimal number 1f would be For each operation, find the result. Your result should be given as a two-digit hexadecimal number with lowercase letters and no Ox prefix. You must also indicate whether or not there is overflow (write "yes" or "no" in all lowercase). (Note that overflow could occur in either direction.) If there is overflow, note that you should not include the overflow digit in your answer. I'd recommend converting the numbers to binary first, then computing the result (making note of whether or not overflow occurs), and finally converting the lowest 8 bits of the result back into hexadecimal. 2b 2b- Overflow? 80 b3- Overflow? Overflow? Write the UTF-8 encoding in hexadecimal for each of the characters below. Do this by first converting the decimal number for each character into binary, and then populating the necessary number of bytes with the binary digits according to the UTF-8 standard. As with the previous exercise, use only lowercase letters, use as few digits as possible, and do not include the Ox prefix. A (uppercase A, represented by the decimal number 65) (division sign, represented by the decimal number 247)