Binary/ Linear Programming Question

1. Coogan Construction is in the process of installing power lines to a large housing development. The goal is to minimize the total length of wire used, minimizing cost. Here is the correct model I submitted and need in excel showing flow, flow balance equation, and capacities:Connect Nodes as follows:Node 1 to node 3 = 1Node 4 to node 1= 2Node 6 to node 3= 3Node 7 to node 6= 3Node 2 to node 1= 4Node 5 to node 4= 4Node 9 to node 7= 6Node 8 to node 9= 3Node 10 to node 9= 4Node 11 to Node 10= 3Node 13 to node 11= 3Node 12 to node 9= 5Node 14 to node 12= 4Total = 45Therefore, 4500 feet of wire is needed to connect these houses.2. There are need to add in () throughout the text which were marked incorrect in my original submission and I was told to add whatever Decision variables I typed in.The road way system around the hotel complex (node 1) near a large amusement park (node 11) is shown in PDF problem 2. The numbers by the nodes represent traffic flow in hundreds of cars per hour. What is the maximum flow of cars from the hotel complex to the park?Need in excel showing flow, flow balance equation, and capacities, picture of the model is attached in PDF problem 2.Xij= Number of cars traveling from node i to node j4 is a one way street therefore 4 receives a 1 so we set X41=0Objective Function: Maximize total number of cars flowing around node 1 and flowing through node 11.Therefore the objective is: Max X11,1Constraints:1. (X21+X31+X51) – (X12+X13+X14+X15) = 0(Need to add X11,1 ?) to 1.2. (X12) – (X21+X26) = 03. (X13+X73)-(X31+X37)= 04. (X14+)-( X47+X48)= 05. (X15+X85)-(X51+X58)= 06. (X26)-(X69)= 07. (X37+X47)-(X73+X7,10)=08. (X48+X58+X10,8)-(X85+X8,10)=09. (X69)-(X9,10)=0(Need to add x9,11?) to 9.10.(X7,10+X8,10)-(X10,8)=0(Need to add x10,11? to 10.11. (X9,11+X10,11)=0(Need to add x11,1?) to 11.