3. Consider the language of directed graphs L = (1+01+00)+, where an edge is encoded as the node index of the head (in unary notation) followed by a 0 followed by the node index of the tail (in unary notation) followed by 00.\ \ 3a. If possible, use the Pumping Lemma to show that L is not regular. Otherwise, determine the minimum pumping value, p, for this language and explain how that was determined.3b. If possible, give a Fin3c. Given that L captures a syntactic representation of a directed graph, discuss its validity in terms of capturing the semantics of directed graphs. E.g., think about some specific strings in L and whether there is any ambiguity or problem concerning them (e.g., is it possible to describe all directed graphs with this notation?). Give an example of a graph\ that is not in L, if one exists.ite State Automaton for this language; i.e., give the FSA 5-tuple\ (Q, \\\\Sigma , \\\\delta , q0, F ) as well as a correct state transition diagram.3c. Given that L captures a syntactic representation of a directed graph, discuss its validity in terms of capturing the semantics of directed graphs. E.g., think about some specific strings in L and whether there is any ambiguity or problem concerning them (e.g., is it possible to describe all directed graphs with this notation?). Give an example of a graph\ that is not in L, if one exists.