Need help with the second question

1. Consider the following NFA with {0, 1} as its alphabet. For each of the input strings 0100 and 1010, show a tree of configurations that decides whether the NFA accepts or rejects the input string. In each tree, indicate whether each leaf is an accept or a reject configuration. B 0 A E) 30 0,1 2. Use subset construction to convert the NFA given in problem i to an equivalent DFA. Each DFA state should be named with a number of NFA state names in alphabetical sequence. If the empty-set state is necessary, name it {}. The alphabet of the NFA is the set {0, 1}. Show the transition function of the resultant DFA as a table and clearly specify the start state and the set of final states of the resultant DFA