. Question 7 0/ A B C D E A 51 11 13 47 24 B 51 35 9 48 50 C 11 35 3 34 29 D 13 9 3 22 20 47 48 34 22 45 F 24 50 29 20 45 The weights of edges in a graph are shown in the table above. Apply the sorted edges algorithm to the graph. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA Calculator Submit Question MacBook Pro QC ring E B luations D A a What is the degree of vertex C Calculator Submit QuestionFall 2022 Home 14 Announcements Modules Grades yllabus eople E Online Tutoring Q earch Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Draw the edges leading List included in the minimum cost spanning tree on the graph below. Course Evaluations Important Note: You may have difficulty drawing multiple edges to a vertex. When that happens, draw a line segment to a location near the vertex, and A D then drag it to the desired vertex to make the connection. Clear All Draw: Line Segment What is the total weight of the minimum weight spanning tree? MacBook ProFind an Euler path for the graph. Enter your response as a sequence of visited, for example, ABCDEA. ' a Calculator Submit Question G C A ons H Find any Hamiltonian circuit on the graph above. Give your answer as a list of vertices, starting and ending at the same vertex. Example: ABCA Calculator Submit Question MacBook Pro1022 ouncements ules 10 les bus ble ne Tutoring ch Draw the circuit produced using the nearest neighbor algorithm starting at the vertex on the far ling List right. rse Evaluations Draw by clicking on a starting vertex, then clicking on each subsequent vertex. Be sure to draw the entire circuit in one continuous sequence. Click outside the graph to end your path. Clear All Draw: Polygon Calculator MacBook Pro