Let C' be a q-ary (n, M, 3)-code. Prove that the Hamming bound B =q"/V(n, 1) is better (i.e., smaller) than the Singleton bound Bs = q-3+1 if and only if n>q+1. In other words, prove that B q+1.