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.$

$3$a$.$ 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.