Hi please help answering these questions thank you

Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 13 If A and B are any two sets, then A U (A n B) is equal to. Not yet answered Select one: Marked out of O a. B' 1.00 F Flag O b. A question O C. B O d. A'Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 18 Transition function maps. Not yet answered Select one: Marked out of O a E*( >E 1.00 Flag O b. ( * E -> Q' question OCO*Q ->E od. ( * E ->Q O e.E* E ->QDiscrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 20 Refer to the binary tree below: Not yet answered 14 Marked out of 1.00 2 11 F Flag question 1 3 10 30 7 40 How many of the nodes have at least one sibling? Select one: O a. 9 O b. 5 O c. 8 O d. 7 O e. 6Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 24 Refer to the binary tree below: Not yet 14 answered Marked out of 11 1.00 F Flag 1 3 question 10 30 7 40 How many leaves does it have? Select one: O a. 8 O b. 2 O C. 9 O d. 6 O e. 4Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 28 Is tree below a binary search tree? Not yet answered 55 Marked out of 1.00 17 60 Flag question 1 1 5 20 42 105 3 9 55 Select one: O a. Maybe O b. Yes O C. No O d. Cannot be determinedDiscrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 49 For which of the following does there exist a graph G = (V, E, q) satisfying the specified conditions? Not yet answered Select one: Marked out of O a. A sentence or phrase that completes a thought. 1.00 F Flag O b. A graph with 5 components 12 vertices and 7 edges. question O c. Both the numerator and denominator for the next event's probability change. O d. A tree with 9 vertices and the sum of the degrees of all the vertices is 18. O e. A connected graph with 12 edges, 5 vertices, and fewer than 8 cycles.Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 4 Which of the following is EQUIVALENT to {c, re, a,t,e}? Not yet answered Select one: Marked out of O a. {f,a,i,t, h} 1.00 F Flag O b. {4} question O C. (5} O d. {c,re,a,t,e)Discrete Structures 2 Dashboard / My courses / CS6201 / Week 14: Final Exams / Final Exam Question 9 If I calculate the probability of an event and it turns out to be -0.7, I know that Not yet answered Select one: Marked out of O a. I made a mistake. 1.00 Flag O b. the probability of it not happening is 0.3. question O c. No correct answer O d. the event is probably going to happen. O e. the event is probably not going to happen.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: Flag O a. ll only question O b. I only O c. cannot be determined O d. I and ll O e. None of the statements are true