Assume L is a regular language. prove that each must be a regular language. closure property

Problem 12. (10 points) Assume L is a regular language. Prove that eac h of the following must be regular languages. SUFFIX(L)-(w : there is a word wi w E L.). .MITCs(L)-(strings created by ornitting all e's from a word in L. . LONG(L) = {we L & Iu12 10). CHANGESOMEBsToCs(L) (strings created by changing some b's to e's)