Question 4. The "tail" of a language is defined as the set of all suffixes of its strings. That is tail(L) = {y : zy e L for some z e *) (i). ILw E (a,by* w contains exactly three b's), give a brief description of tail(L) ii. Show that if L is any regular language, then tail(L) is also a regular language. As with Question 3, you can assume fa, b) if you like. Hint: There could be various ways to prove this, but the argument I found involves starting with an NFA for L and altering it in a specific way.)