Problem 1 Consider the language L3 defined as follows: L3 = {w E {gb}*| the third letter of w is b} (a) (4 pts) Construct a DFA D3 recognizing the language L3. (b) (4 pts) Give a regular expression describing the language L3. C (4 pts) The top paragraph of page 14 of the textbook defines the reverse of a string. The reverse of a language L is the language LR containing the reverse of every string in L. Give a regular expression describing h. (d) (4 pts) Give an NFA Mr accepting the reversal languagel. (e) (4 pts) Now, convert NFA MR into its equivalent DFA DR