Head TA Joves has been working on a problem . He correctly p…
Head TA Joves has been working on a problem . He correctly proved the following two statements: (1) There exists a verifier for that runs in polynomial time. (2) Every algorithm that solves the problem runs in time greater or equal to , where n is the input size. Which of the following can we conclude from Joves’ work?