Let us consider the following procedure: Procedure Skip Input: string w over the alphabet = {0,1,2}. Let l be the length of w. Output: string w'. Set i = 1. Initialize w' to be E. While i sli Append wito w'. If w; = 0: i = i + 1. If wi = 1: i = i + 2. If w; = 2: i = i +3. End. Suppose L is a regular language. Show that L is closed under the Skip operation. That is, show that the following language is also regular: L' = {w' | w' Skip(w) and w EL}