A pipeline is to be built that will link eight cities (A, B, C, D, E, F, G, and H). The cost (in hundreds of millions of dollars) of constructing each potential link depends on distance and terrain and is shows in Table 1. Table 1 To A B D E F G H From A - 5 5 1 - 10 B un 1 - 6 8 - 1 1 - 1 1 - 4 D 1 1 00 3 E - 8 5 7 1 F 6 4 3 5 - 2 G 8 7 2 9 H 10 9 i. Draw the weighted graph to represent the information in Table 1. (3 marks) Use Kruskal's algorithm to find a system of pipelines to connect all the cities and yet minimize the total cost. (6 marks) iii. Draw the system of pipelines that produces the minimum total cost in (ii). (1 mark)