A salesman is travelling the peninsular of Malaysia for his business. The distances between the states are given in the diagram below. Find the minimal spanning tree for the diagram by using (show all your steps) (a) Kruskal's algorithm (10 marks) (b) Prim's algorithm where the Pahang vertex as a starting point. (7 marks) Compare your answers for parts (a) and (b). Discuss your answers in terms of their similarity or differences. Will the answer unique for Prim's algorithm if the starting point has changed, why? (8 marks) N Kedah Pepe wang 270 Kelantan 236 305 Terengganu 310 Panang 172 Kuala Lumpur 158 201337 170 Johor