(i) Working with the alphabet {a, b, c} there is a language defined by the regular expression
a*b (ca + bb)*
Encode this language into a language over {a, b}. Is the encoded language regular?
(ii) Show that if a language is regular over one alphabet, then it is still regular when encoded in a different alphabet, by any substitution code.