Assume that constructing a DFA from DFA(s) takes polynomial time. Also assume that TM T can decide ETM in polynomial time. Provide an analysis of the time complexity to show that TM F below that decides EQTM runs in polynomial time. F = On input (A, B), where A and B are DFAs:
1. Construct DFA C such that L(C) = (L(A) n L(B) U (L(A) N L(B)).
2. Run TM T that decides EDFA from Theorem 4.4 on input (C).
3. If T accepts, accept. If T rejects, reject.