1. [26 points] Consider a 9-bit machine that supports both signed and unsigned arithmetic. On this machine both int and unsigned are encoded using all 9-bits. Assume as well that two's- complement encoding is used for the signed values. Fill in the missing entries in the following table, where: Umin indicates the minimum possible Tmin indicates the minimum possible int unsigned value value Umax indicates the maximum possible Tmax indicates the maximum possible unsigned value int value Number/Type Decimal Value Binary Encoding Umin Umax Umin + 1 Umax + 1 int 224 int -23 int 0 0110 1100 int 1 1110 0101 Tmax Tmin Tmin + Tmin Tmin + 1 Tmax + 1 - Tmax -Tmin