Question 3. (35 P) Assume that the network given in Figure 3 represents six different districts (nodes) in Izmir and the local transport authority wants to design a rail system that will connect six districts (nodes) with a minimum distance (miles). The miles between each district are shown on each branch. For example, between district (node) 2 and district (node) 5 is 6 miles while between district (node) 4 and district (node) 6 is 2 miles. Similarly, you can find the rest of the miles between the districts (nodes) on the branches through the network in Figure 3. Develop a minimal spanning tree for this problem. That is connect all nodes in a network so that the total of the branch miles is minimized. Important note: Please only write and explain each step and do not draw network for each step. Draw a network only for the final step. Calculate the total distance. Figure 3. Network for six different districts (nodes) with the miles between each district on the branches through the network for city Izmir