Construct a computation tree for the NFA in Figure 1 as it processes abbab. a 90 94 a b 91 93 b b 92 a 95 Figure 1: NFA N b) (20 pts) Construct a deterministic finite automaton equivalent to the dows nondeterministic finite automaton given in Figure 1. Go to Settings to activate W