Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 14 "Which of the following statements is/are correct? Not yet I. A graph G is a tree if and only if it is connected, but deleting any of its edges results in a disconnected graph. answered Il A graph G is a tree if and only if it contains no cycles, but adding any new edge creates a cycle." Marked out of 1.00 Select one: F Flag O a. ll only question O b. I only O c. cannot be determined O d. I and Il O e. None of the statements are true