Prove that a language L belongs to NP if and only if a language LcheckP and a polynomial p exists such that L={xy.x,yLcheckyp(x)} 5(c) [10 Marks] Describe a problem that belongs to the class NP and, using the theorem in part(b) of this question, prove that it is a NP problem. [End Question 5]