The goal of this question is to detect whether a plain-text document has a postal code in it somewhere. A valid postal code is of the form ABCDEF or ABC DEF, where A, C, E are letters of the english alphabet, and B, D, F are numeric digits. Let E be the alphabet of all letters in the plain text-file (including newlines, digits, punction, brackets, etc.). Build an NFA (drawing a transition diagram is enough) that accepts all plain-text documents that have a valid postal code 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