Can you explain in details how to solve this problem?

P and NP Consider the following decision problem: ODD-CYCLE: Given some input graph G, does it contain a cycle of odd length? You want to show this decision problem is in NP (a) What is a convincing certificate a solver could return for this problem? (b) Describe, in pseudocode, how you would implement the verifier (c) What is the worst-case runtime of your verifier? (d) Do you think it's likely this algorithm also happens to be in P? Why or why not? 13. Short