-------------------------------------

Data Structures & Algorithms Problems.

Please read carefully and ONLY FULL ANSWERS will get positive rate.

Thank you.

For the following graph use Kruskal's algorithm to find a minimum-cost spanning tree, and then determine the minimum cost. Use alphabetical ordering. 6 Construct a hash table using the lengths of the edges to store the edges Sort the edges in each bucket using alphabetical ordering, Edge List (Hash Table) Sorted Edge List (Hash Table) 4 CE BD DF Construct a minimum cost spanning tree by using the edges in each bucket moving from left to right starting with bucket with the lowest value: Minimum Cost Is the graph bipartite? yes no