Please solve Q3, Q6

Q3

Consider the following network. Suppose the network represents a subdivision of new houses and the developer wishes to minimize the usage of water pipes in order to connect all houses to the water source. The distances between houses are given in yards. Use the minimum spanning tree approach to find the minimum distance to connect all house to the water system. How many yards of pipe will need to be laid by the developer to serve each house using the least amount of pipe?You are given output le and sensitivity.Ir analysis for a prot maximizing rm. The optimal solution is given here along 1with the problem set up. This rm is producing six outputs x1, x2, Kg, K4, X5 and Kg and using three inputs hi, b2, and '33. The unit cost of input 1 {hi} is $0.50 per unit, for input 2 \"32} is $0.25 and for input 3 {b3} is $0.35. Suppose that simultaneoust the amount of input 1 decreases by 3D units, the amount of input 2 decreases by 3 units. and the amount of input 3 increases by 10 units. Use the 100% rule to determine the rm's change prot. QUESTION A: The problem is on Canvas. QUESTION B: Use chart right below. QUESTION C: The problem is on Canvas. QUESTION D: Use the charts on the following page. 2 QUESTION D: Use the charts right below. Production Activity x2 x3 x4 X6 Maximum Profit Amount Produced 0.00 8.64 32.05 0.57 0.00 0.00 175.00 Unit P $5.00 $4.00 $9.00 $8.00 $6.00 $7.00 Unit MC; $4.20 $1.85 $4.20 $3.40 $3.45 $4.90 Unit Profit (P; - MC;) $0.80 $2.15 $4.80 $4.60 $2.55 $2.10 Constraints Resource Usage Total LHS RHS Slack Unit Input x1 x2 x3 x4 x5 X6 Cost Constraint 1 2 5 N w 170 170 0 $0.50 Constraint 2 4 4 4 8 165 165 0 50.25 Constraint 3 7 2 4 2. 4 75