Chrome File Edit View History Bookmarks Profiles Tab Window Help Q Mon Sep 5 7:59 PM TEMUS Quiz: 01 Evaluate: Graphs, Path X Q Advanced Quantitative Reason X Homework Help - Q&A from Or X G how to take a screenshot on m. X + - > C a uths.instructure.com/courses/4403/quizzes/67256/take Spacer UTHS Texas Diploma Progra... TEXAS Time Elapsed: Hide Time Home Attempt due: Aug 26 at 11:59pm Modules D 55 Minutes, 51 Seconds Account Use the connected graph below to answer questions 1-4. Assignments Grades Dashboard Secure Exam Proctor B (Proctorio) Courses A Calendar Eh Inbox C History D Studio ? E F Help K D Question 1 10 pts SEP 5 tv Aa OChrome File Edit View History Bookmarks Profiles Tab Window Help Q 8 Mon Sep 5 7:59 PM TEMUS Quiz: 01 Evaluate: Graphs, Path X Q Advanced Quantitative Reason X Homework Help - Q&A from Or X G how to take a screenshot on m: X + - > C a uths.instructure.com/courses/4403/quizzes/67256/take UTHS Texas Diploma Progra... TEXAS Home Modules D Question 1 10 pts Account Assignments Grades What is the degree for each of the vertices? Dashboard Secure Exam Proctor A has degree [ Select ] (Proctorio) Courses B has degree [ Select ] Calendar C has degree [ Select ] Eh Inbox D has degree [ Select ] History E has degree [ Select ] Studio F has degree [ Select ] ? Help D Question 2 10 pts K SEP 5 Aa OChrome File Edit View History Bookmarks Profiles Tab Window Help Q Mon Sep 5 7:59 PM TEMUS Quiz: 01 Evaluate: Graphs, Path X Advanced Quantitative Reason X Homework Help - Q&A from Or X G how to take a screenshot on m. X + - > C a uths.instructure.com/courses/4403/quizzes/67256/take E has degree [ Select ] UTHS Texas Diploma Progra... TEXAS Home F has degree [ Select ] Modules Account Assignments Grades Dashboard Secure Exam Proctor D Question 2 10 pts (Proctorio) Courses Based on the degrees for the graph provided above, which of the following best describes the graph? Calendar Eh Inbox O There is a Euler circuit, but not a path, because there are 2 odd vertices (degrees). History There is a Euler path, but not a circuit, because there are 2 odd vertices (degrees). O There is a Euler path and a circuit because there are an even number of even vertices Studio (degrees) ? O There is no Euler path nor circuit because the sum of the degrees is even. Help D Question 3 10 pts K Which of the following back doccribAc the characteristics of the aranb chown abAun? SEP 5 AaChrome e File Edit View History Bookmarks Profiles Window Help Q 8 Mon Sep 5 7:59 PM Question 3 10 pts Which of the following best describes the characteristics of the graph shown above? It has 9 edges and 6 vertices. It has 10 edges and 6 vertices. It has 1 bridge and 5 vertices. It has 1 loop and 6 vertices. Question 4 10 pts For a graph with seven edges, what is the sum of its degrees? 0 4 O 10 O 14 SEP 5 Aa