The tail of a language is defined as the set of all suffixes of its strings. That is: tail (L) = {y: xy is a subset of L for some x in the set &sigma * . Show that if L is regular, so is tail (L) 1 answer