3. A business man has to visit five cities A, B, C, D and E. The distance (in hundred miles) between the five cities is as follows: А В C DE 7 6 8 8 56 A * 4 B 7 C 6 8 * D 8 59 9 7 8. E 4 7 8 If the...

Extracted text: 3. A business man has to visit five cities A, B, C, D and E. The distance (in hundred miles) between the five cities is as follows: А В C DE 7 6 8 8 56 A * 4 B 7 C 6 8 * D 8 59 9 7 8. E 4 7 8 If the businessman starts from city A and has to come back to his starting point, which route should he select so that the total distance travelled is minimum. 4. Apply Kruskal's Algorithm to determine a minimum spanning tree in each graph.