# Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A

#### Comments and Answers (2)

**Zoe** * *

please explain answer

**Li** * *

need help, explain answer

**{{SampleComment.userName || "Your Name"}}
~ {{SampleComment.userCity}}**

{{SampleComment.commentValue || "Your Answer or Comment goes here...."}}