Exercise 3 Recall the algorithm for converting an NFA to a regex discussed in the automata theory unit. Let n be the number of states of the NFA, and suppose it has input alphabet 10, 1). Show that the running time of this algorithm is exponential in n. It doesn't have to be a tight running time. Just show that it is O(d) for some constant d, and that it is (cn) for some smaller constant c. Exercise 3 Recall the algorithm for converting an NFA to a regex discussed in the automata theory unit. Let n be the number of states of the NFA, and suppose it has input alphabet 10, 1). Show that the running time of this algorithm is exponential in n. It doesn't have to be a tight running time. Just show that it is O(d) for some constant d, and that it is (cn) for some smaller constant c