The goal of this question is to detect whether a plain-text document has a phone number in it some- where. A valid phone number is of the form (abc) def-ghij, where each a,b,c,d,e,f,g,n,i,j are numeric digits. Let E be the alphabet of all letters in the plain text-file (including newlines, digits, punctuation, brackets, etc.). Build an NFA (drawing a transition diagram is enough) that accepts all plain-text documents that have a valid phone number contained within. Feel free to label a transition from arbitrary state p to q with notation such as X e X to represent having a separate transition from p to q on each letter in X