$2.$ Find the minimal spanning tree for the following network shown in question $1$ by starting at node $1.$ Your answer should be presented in the table as shown below. Complete the following table, by filling in the node number that is added to the current subnetwork in each iteration, the number of days associated with the addition of each node and the total number of days of the optimal spanning tree. $($NO NEED to draw the optimal spanning tree.$)(8$ marks$)$

Answer to Question $2$: