Problem: A transportation company is trying to optimize the routes for its fleet of trucks. The company has four warehouses (W1, W2, W3, and W4) and five destinations (D1, D2, D3, D4, and D5). The distance between each warehouse and the destination is as follows: The company wants to find the optimal route for each truck to minimize the total distance. Use the Gaussian elimination method to solve this system of equations. TIPS: We can represent this problem using matrices and a system of linear equations. Let x1,x2,x3,4,x5 be the number of trucks that will be sent from W1, W2, W3, W4 respectively to D1, D2, D3, D4, and D5. Then, we can write the following system of linear equations: 201+302+403+504=D1 (distance between warehouse and destination) 401+502+603+704=D2 501+402+303+204=D3 601+202+103+204=D4 801+702+603+504=D5 x1+x2+x3+x4=T (total number of trucks)