Suppose you are working as a software engineer for a navigation system company. Your company has recently signed a contract with a transportation company to develop a navigation system for their drivers. One of the key requirements of the system is to calculate the shortest route between two locations. You are tasked with applying Dijkstra's algorithm to calculate the shortest route between two locations. The road network has a total of X nodes and Y edges, with each edge representing a road connecting two nodes. There are at least Z duplicate routes between the two cities, and the weights of the edges represent both the distance and the speed limit of the road. [Teacher to specify X,Y and Z for each group, minimum value for X is 16, Y is 23, Z is 5] 2. Draw a sample graph of the road network and demonstrate how Kruskal's algorithm would be applied to construct the Minimum Spanning Tree for the network. [X is 16, Y is 23, Z is 5.], using later" a to p" as nodes[8 marks] 3. What if there are multiple Minimum Spanning Trees possible for the graph? How would you choose one? [2 mark]