A company has two trucks to deliver products to their 4 customers from their warehouse. Given the following distances between customers and the warehouse. find a solution that will generate the minimum distance to deliver products to all customers, utilizing both trucks from the warehouse from/to distance matrix Warehouse Customer 1 Customer 2 Customer 3 Customer 4 in km Warehouse 0 2.24 10 11.31 9.22 Customer 1 2.24 0 7.81 9.22 7.07 Customer 2 10 7.81 0 2 1 Customer 3 11.31 9.22 0 2.24 Customer 4 9.22 7.07 2.24 0 2 1 The name of this problem Travelling Salesman Problem (TSP) B The name of this problem Vehicle Routing Problem (VRP) We need a total of 50 decision variable to model this problem The value of the objective function would be 36.92 Km The solution would be 1 truck to visit WH1, the other to visit 2,3,4