Can figure out this spanning tree worksheet please help

1. Determine if the wiggly edges form a spanning tree. If not, give the reason(s) why not. a+ E b. D E F C. C D E d. C D E2. Find two spanning trees of the graph. D C E B B 3. Sort the edges from least to greatest. Apply Kruskal's Algorithm to find a minimum-cost spanning tree. What is the total cost? 7 14 12 104. Sort the edges from least to greatest. Apply Kruskal's Algorithm to find a minimum-cost spanning tree. What is the total cost? 5 11 5 3 3 2 10 4 6 3 7 5. Whenever an outbreak occurs (infectious disease, STDs, etc.), you usually hear talk of "patient zero"- the original source of the outbreak. Explain how trees can be used to trace back to the alleged patient zero.6. Color the vertices using the Greedy Coloring Algorithm. You must begin at vertex A with color #1. A B Barkrnrplay has 5 dogs visiting their familit}.r today. Some of the dogs don't get along and cannot plat}.r together as indicated by an x below. To avoid any fighting, you decide to set up different play times. Graph and color the following chart so that then: is no conict. \"'hat is due graph's chromatic number and what does it mpresenr? 9. You want to have a small gathering with some friends. Unfortunately, some of them do not get along with each other as indicated with an x below. To avoid an awkward situation, you decide to only let those who get along sit together at each table. Graph and color the following chart so that there is no conflict, What is the graph's chromatic number and what does it represent? A B C D E F A X X C D X X F X X X