Consider the code C = {000, 010, 101, 110} over the alphabet A = {0, 1}. Construct a nearest-neighbor decoding process for C and compute the word error probability for the word 110, assuming that the symbol error probability p is equal to . Show all your working. [12]