Do you think it is wise to base your decision in part g only on an optimal solution for a variant of an assignment problem? a. Describe how this problem fits the network description of a minimum spanning-tree problem. b. Use the greedy algorithm presented in Section 7.5 to solve the problem. What is the total cost for the special phone lines?