Let sigma = {a, b, c, d, e). Let L be the language consisting of all finite length strings over sigma such that at least one symbol in sigma is missing in each string in L. Prove that L is regular