Please explain how you got the answer, thanks

Fix a finite alphabet = ta,b} and define for a string w 2 . . . over the operation fifth (w-515 . . . . In words, this operation extracts all characters at positions divisible by 5. We can naturally extend this operation to languages: if L is a language, fifth(L)-{fifth(w) : w L} Prove that if L is regular then fifth(L) is also regular