Problem 4 (20 points): Write a regular expression for the following language L over (0, 1): L = { w . I every pair of adjacent 0's in u, appears before any pair of adjacent l 's} For example: e, 00, 10000111 011, and 111 are in L. Provide Justification that your regular expression is correct