Prove the following: if there is a an (n,M,d)q-1 code, then there is an (n,M,d)q. Where n is length of the code, M is the number of members in the set, d is minimum distance and the code is q-ary