Problem I (Hamming Distance) a) Compute the Minimum Hamming Distance (MHD) for the coding (1101011, 1010110, 0000011, 0001100) b) Modify the code by changing a single bit to increment the previous MHD by 1. Problem Il (ASCII Codes) Use the ASCII translation table to convert the following binary representation to alphanumeric. #1 01000111 01101111 01101100 01100100 01100101 01101110 00100000 01000001 01110010 01100011 01101000 01100101 01110011 00100000 01000110 01101111 01101111 01100100 #2 01000011 01101000 01101001 0110110o 01100100 01110010 01100101 01101110 00100111 01110011 00100000 01010100 01010110 00100000 01010011 01101000 0110111i01110111 Problem IV (Arithmetic with BCD) Convert the number into BCD representation and perform the following operations. a) b) 11 + 26 541 -216 c) 27+36 Problem VII (Logic Simplification) Simplify the following logic expressions (A+ B)(C + B)(D+ B)(ACD + E) a) ( +B + T)(+T + D)E + D)