Q1) Minimum spanning tree problem with constraints. - Objective: Connects all nodes with minimum costs Constraints 1: Link AD can be included only if link DE also is included. (penalty:100) Constraints 2: At most one of the three links AD,CD, and AB - can be included. (Penalty of 100 if selected two of the three, 200 if all three are selected.)