Convert the following NFA to a minimal DFA using shortlex labels. You may represent your DFA either as a directed graph, or via a state transition table (states listed in shortlex order). If a directed graph, draw it so that no edges cross. If a table, be sure that the accept states are clearly identified and that each state has an entry for each member of the alphabet