Consider the NFA defined by the state diagram below. Follow the algorithm seen in class

and in our textbook to construct an equivalent DFA. You can provide either a state diagram

or a formal definition of your DFA. Please only include the states reachable $($in one or more

transitions$)$ from the start state.