P Problems are problems that can be solved with a polynomial time algorithm.
Minimizing 2 DFA's will take polynomial time.
and converting NFA to DFA can take upto exponential time hence A will be the answer
also for c, equivalence of two Turing machines is undecidable
source : https://link.springer.com/chapter/10.1007/3-540-63174-7_13
