En is the language that contains all and only strings that, in turn, contain nothing but the letter "e" some integer multiple of n times: En = {e* | k is a multiple of n}. Show that this language is...

Extracted text: En is the language that contains all and only strings that, in turn, contain nothing but the letter "e" some integer multiple of n times: En = {e* | k is a multiple of n}. Show that this language is regular for any positive integer n. (Hint: You do not need induction.)