Work the following problems neatly and completely. Upload your solutions. They may be any combination of image, Word, or PDF files. Basic calculations need not be shown step by step, but explanation of the solution is necessary. [Problem points in brackets.] 1. Draw an example of a disconnected, unweighted, directed graph. [6] 2. Draw an example of an weighted tree. [6] 3. Use Kruskal's Algorithm to find the minimal spanning tree for the graph given below. [6] 4. Draw the graph represented in the table below then find a minimal spanning tree. [6] CD EFG A O 7 6 3 0 5 O 6 O CO O 0 O 5. Run Dijkstra's Algorithm to find the shortest routes from A to all other vertices of the following graph with the given distances. [6] 200 B 100 100 50 150 100 200 100 40