please provide explanation. Answer both question 1 and 2. Need L as a regular expression and draw DFA diagram.

Let ={a,b,c,,z} be the alphabet of lower case characters. Pick the name (first and last name) of any group member. Let L be the regular language of all character sequences that contain the first name and that order as substrings (with the names in lower case omitting any special characters). Before, between, and after the names there may be arbitrary many (including 0 . arbitrary characters. 1. Write L as a regular expression. 2. Draw the graph of a DFA M=(Q,,,q0,F) that recognizes L