1. Recall Definition 1.5 from the book: a DFA is a 5-tuple (Q, E, 8, q0, F'), where: o Q is a finite set called the states, • E is a finite set called the alphabet, o 8:Q x E → Q is the transition...

in python

Extracted text: 1. Recall Definition 1.5 from the book: a DFA is a 5-tuple (Q, E, 8, q0, F'), where: o Q is a finite set called the states, • E is a finite set called the alphabet, o 8:Q x E → Q is the transition function, o qo € Q is the start state, and FCQ is the set of accept states. Our first task is to design a data representation for this mathematical DFA definition. You may use objects, structs, or anything else available in your language. You may need to create multiple data representations, for various parts of the DFA.