1. Consider the following NFA with {a, b} as its alphabet. Show a computatiuon tree for each of the input strings baab and abba. In each computation tree, indicate whether each leaf is an accepting or a rejecting configuration. Use the algorithm discussed in the class to convert the above NFA to an equivalent DFA. In the DFA, be sure to indicate its start state and its final states, and show its transition function as a state diagram. Write the numerals in each DFA state name in ascending order