Consider the operation ProperPreOrSuffix(L) on languages over the al- phabet = {a, b, c}. ProperPreOrSuffix(L) = {x | w L, y = and w = xy or w = yx} Show that regular languages are closed under the operation ProperPreOrSuffix using the substitution technique