You need to show a complete proof/ example for each item (e.g. DFA/ RE, CFG/ PDA, Turing machine, DEC, P). If a DFA or a PDA exists, you still need to exhibit a Turing Machine recognizing the language. If it does not exist, a counterexample is required.

8.) Show that E_DFA in P . Solve and explain

Show that E_DFA P.