for second question, choose from below

1. facility location problem

2. traveling salesman problem

3. shortest path problem

4. assignment problem

5. set-covering problem

6. transportation problem

Question 1 1 pts Which of the following is not true? In the minimum cost flow problem, decision variables are the number of units shipped among nodes. Shortest-Path problem is a network optimization problem. Transportation Problem and assignment problems are special cases of the minimum cost flow problem. Shortest-Path problem is a hard problem and can only be solved approximately. Question 2 2 pts For each description in the left, match the most appropriate problem name on the right. [Choose] The problem of locating warehouses to minimize the total distance that must be traveled to provide required services. [Choose ] > Given two finite sets (called Set 1 and Set 2), the problem of minimizing the required number of elements in Set 2 to serve all the elements in Set 1. [Choose ] Given two finite sets (called Set 1 and Set 2), the problem of minimizing the cost of assigning, on a one-to-one basis, elements of Set 1 to elements of Set 2. [Choose ] > The problem of minimizing the cost of shipping products from locations (with specified product amounts) to customer locations for satisfying customer demands