Question 2. (20 points: 1+4 points each) Consider the language L below. Are the following equalities true or false (1 point)? Explain your answer (4 points). Remember to check for two kinds of errors: inclusion of incorrect strings omission of correct strings. Note that for regular expressions the operator predence from highest to lowest is: Kleene star (*),concatenation (.), and union (U). For example, bct means (b)(c+). L = {WW {a,b}* and w contains at least one b and at most one a } Part a. L = (ba U b) 6* Part b. L = (b+ab*) U (b*ab+) Part c. L= {w w {a,b}* and w contains at least one b} U {w/w {a,b}* and w contains at most one a} Part d. L= {w|w {a,b}* and w contains at least one b} n {w|w {a,b}* and w contains at most one a}