The question is about Complexity Classes: P and NP

The class P describes all languages (or problems) described by a Turing Machine decider, whose time complexity is bounded by a polynomial on n

Suppose the following PDA P=({q,r}, {0,1}, {Zo, X}, 0, q, Zo, ) is given: 0, Z/XZ. 1, Zole 0, X/XX 1, XXX 1, X/X E, X/ Start E, X/ 9 Convert P to a PDA P' with L(P') = N(P). Suppose the following PDA P=({q,r}, {0,1}, {Zo, X}, 0, q, Zo, ) is given: 0, Z/XZ. 1, Zole 0, X/XX 1, XXX 1, X/X E, X/ Start E, X/ 9 Convert P to a PDA P' with L(P') = N(P)