3. Prove or disprove: If L is regular language then Triple(L) = {x \x = uvw where u, v, w E L and|u1 = [v] = [w]} is also regular. Hint: Consider the language L = 0*1