: Write a regular expression for the following language L over = {0, 1}:

L = {w | every pair of adjacent 0s in w appears before any pair of adjacent 1s}

Problem 4 (20 points): Write a regular expression for the following language L over -10, 1): L-{w E * | every pair of adjacent 0's in w appears before any pair of adjacent 1's} For example: , 00, 1000011 1011, and 111 are in L. Provide Justification that your regular expression is correct