2 10 PoINTS] DFA AND REGULAR EXPRESSION Let D-(wlw contains even number of as, odd numberofb's and does not contain the substring ab Give a DFA with 5 states that recognizes D and a regular expression that generates D. Hint: As in the first question, try to understand what actually D is 3 [10 POINTS] DECIDING REGULARITY Let L be a regular language. Define P = { ul uu E L), ie., that are pre fixes of the strings in L. Prove or disprove that P is regular P isthe language consisting of strings