d) Data Communication company has offices A, B, C, D, E, F, G, H, and I. Table 1 shows the cost, in Ringgit Malaysia (RM), of transmitting a piece of information from one of the offices to another along all existing direct links. Table 1 A D E F G I From 4 8 ! 8 B 4 11 8 7 4 2 D 7 9 14 E 9 10 F 4 14 10 2 G 2 1 6 H 8 11 1 7 I 2 6 7 i. Construct a network using vertices A to I to represent the information in Table 1. (3 marks) ii. A piece of information has to be passed from office A to all the other offices, either directly or by being passed on from office to office. Use Kruskal's algorithm to find the minimum total cost of passing the information to all the offices. (6 marks) Draw a network that produces the minimum total cost in (ii). (1 mark)