An important use for DFAs is text search. Let's fix as our alphabet to be the 256-member ASCII character set. Below is a partial diagram of a DFA that accepts a text string iff it contains the word "cacao" as a substring: ca cac caca cacao All omitted edges point back to the start state. The edge labeled "" indicates that this transition is to be taken upon reading any symbol in , i.e., any ASCII character. Notice that each state is labeled with the longest prefix of the search string ("cacao") that is a suffix of the input seen so far Using the same idea, draw a diagram of an eight-state DFA that accepts an ASCII string iff it contains the word "oopoops" as a substring. Label each state similarly to the example above. As above, you may also suppress transitions to the start state