Suppose L is a regular language. Consider skip-one(L) to be the language of words from L that are missing exactly one symbol. For example, if L = {abc,bbb} then skip-one(L) is {ab,ac,bc,bb}. Formally, w skip- one(L) if and only if there exists x,y ,a where w = xy and xay L. Prove that skip-one(L) is regular. (Hint: define a construction for a finite state machine machine ML and prove that L(ML) =skip- one(L).