Reconsider the example of an unconstrained minimum spanning tree problem given in Sec. 10.4. Suppose that the

Question:

Reconsider the example of an unconstrained minimum spanning tree problem given in Sec. 10.4. Suppose that the following constraints are added to the problem:
Constraint 1: Either link AD or link ET must be included.
Constraint 2: At most one of the three links—AO, BC, and DE—can be included.