9-39. Grey Construction would like to determine the leastexpensive way of connecting houses it is buildingwith cable TV. It has identified 11 possible branchesor routes that could be used to connect the houses.The cost in hundreds of dollars and the branches aresummarized in the following table.(b) After reviewing cable and installation costs,Grey Construction would like to alter the costsfor installing cable TV between its houses.The first branches need to be changed. Thechanges are summarized in the followingtable. What is the impact on total costs? The table provides information about various branches, each defined by a starting node, an ending node, and an associated cost. This data is likely relevant for studies involving networks or graph theory, possibly focusing on the costs of traversing different paths.### Table Description- **Columns:** - **Branch**: Enumerates the branches from 1 to 11. - **Start Node**: Indicates the initial node of the branch. - **End Node**: Indicates the terminal node of the branch. - **Cost ($100s)**: Represents the cost associated with each branch in hundreds of dollars.- **Data:** - **Branch 1**: Connects node 1 to node 2 with a cost of $500. - **Branch 2**: Connects node 1 to node 3 with a cost of $100. - **Branch 3**: Connects node 1 to node 4 with a cost of $1000. - **Branch 4**: Connects node 1 to node 5 with a cost of $100. - **Branch 5**: Connects node 2 to node 6 with a cost of $700. - **Branch 6**: Connects node 3 to node 7 with a cost of $500. - **Branch 7**: Connects node 4 to node 7 with a cost of $700. - **Branch 8**: Connects node 5 to node 8 with a cost of $500. - **Branch 9**: Connects node 6 to node 7 with a cost of $100. - **Branch 10**: Connects node 7 to node 9 with a cost of $600. - **Branch 11**: Connects node 8 to node 9 with a cost of $200.This table can be used to analyze paths, minimize costs, or optimize routes within a network.

The problem is about connecting each node with minimum cost. This is a problem with the Minimal Spanning tree. The steps are provided below Step1: Start from Node 1. Keep node 1 as permanent and write the Branches generated from node 1 with their costs. Select the branch having the least cost and add the ending node to the permanent set.There are two branches having least cost 5 i.e. 1-2 and 1-5 I am selecting arbitrarily 1-2 and adding 2 to the permanent node Step-2: After adding the new node add the branches connected to the new node to the branch list and select the least cost among all and add the node to the permanent list as shown aboveSelecting1-5 as it is having least cost and add 5 to the permanent node Repeat the above steps to find the minimum cost network Step3:Select 5-8 branch having least cost and add 8 to permanent node Select 8-9 and add 9 to permanent node As from 9, there is no node connected and it is the ending node try to select the least cost branch from remaining in the next stepSelect6-7 as having the least cost 1 The total cost would be 1-2=5 1-3=6 1-4=6 1-5=5 3-7=5 5-8= 4 6-7=1 8-9=2 Total = 5+6+6+5+5+4+1+2=34($100s)Changed one Only the cost has been decreased So the total cost would be 5+1+1+1+5+4+1+2=20 The solution remains the same as the least cost values are to be taken into the solution