Question 2 1 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. 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 ] Transporation Problem Facility Location Problem Traveling Salesman Problem Shortest Path Problem Set-Covering Problem Assignment Problem [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 Question 2 1 pts For each description in the left, metathematosancita s oblem name on the [Choose right Transporation Problem Facility Location Problem The problem of locating warehouses Traveling Salesman Problem to minimize the total distance that Shortest Path Problem must be traveled to provide required services. Set-Covering Problem Assignment Problem Given two finite sets (called Set 1 and [Choose ] 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 2 A la 10 ENG [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. Given two finite sets (called Set 1 and [Choose] Set 2), the problem of minimizing the cost of assigning, on a one-to-one (Choose] basis, elements of Set 1 to elements Transporation Problem of Set 2. Facility Location Problem The problem of minimizing the cost of Traveling Salesman Problem shipping products from locations (with Shortest Path Problem specified product amounts) to Set-Covering Problem customer locations for satisfying customer demands. Assignment Problem a SUA 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 [Choose Transporation Problem Facility Location Problem Traveling Salesman Problem Shortest Path Problem Set-Covering Problem Assignment Problem Question 3 Which of the followinntate