= 3. (20 points) Let L be any language and let Lalt be the set of strings in L with every other character removed, i.e. Lalt = {1 | By E L such that 01.02.13 ... = Yy345 ...}. As an example, if L = {happy, computation, automata, finite}, then Lalt = {hpy, cmuain, atmt, fnt}. Show that if L is a regular language then Lalt is regular. 1