This problem concerns the Polynomial-Time Hierarchy (PH). We say that a set of binary strings, S, is an element of ? iff there is a PTIME predicate yo and a polynomial p such that, here Qk is V if k is even and 3 if k is odd. Similarly, S is an element of I iff, s- (w l (Yrijzl pl |))(3rlp2ISP(I l)) (Qrk.lrklSP Iw!))(?(w, z? , for some PTIME predicate. Here Qis V if k is odd and 3 if k is even. (a) Prove that NP = (b) Prove that co-NP:Jr. , zk))}, For example, ANP s in ?' because it can be written as Where NCOMP(w, , c, y) is the PTIME predicate meaning that c is a complete halting computation of NDTM Mu on input r and its output is y. This problem concerns the Polynomial-Time Hierarchy (PH). We say that a set of binary strings, S, is an element of ? iff there is a PTIME predicate yo and a polynomial p such that, here Qk is V if k is even and 3 if k is odd. Similarly, S is an element of I iff, s- (w l (Yrijzl pl |))(3rlp2ISP(I l)) (Qrk.lrklSP Iw!))(?(w, z? , for some PTIME predicate. Here Qis V if k is odd and 3 if k is even. (a) Prove that NP = (b) Prove that co-NP:Jr. , zk))}, For example, ANP s in ?' because it can be written as Where NCOMP(w, , c, y) is the PTIME predicate meaning that c is a complete halting computation of NDTM Mu on input r and its output is y