$(20$ pt$)1.$ You are given the below information and asked to solve the Vehicle scheduling problem. A truck is tasked with delivering goods

from the warehouse to each of its stops. For the first part, assume there are no external constraints, but do give the entirety of

the information at the $"1-$city per trip" level, the $"2-$cities per trip" level, etc., as far as you solve it$.$

a$.$ Please draw the optimal solution set $($not necessarily Greedy$)$ for when you only visit $1$ city per trip, and give the path

for visiting the cities and the total cost. $($For example, $"$WH $1WH,$ Cost of XX$")$

b$.$ Please draw the optimal solution set $($not necessarily Greedy$)$ for when you visit $2$ cities per trip, and give the path for

visiting the cities, each path's cost, and the total cost.

c$.$ Please draw the optimal solution set $($not necessarily Greedy$)$ for when you visit $3$ cities per trip, and give the path for

visiting the cities, each path's cost, and the total cost.

d$.$ Please draw the optimal solution set $($implementing a Greedy approach$)$ for when you visit $5$ cities per trip, and give

the path for visiting the cities, each path's cost, and the total cost.

e$.$ Explain how you chose your cities in $($d$)$ above.

f$.$ Now assume that your truck has a maximum capacity of $200$ pallets. The table below shows how many items need delivered

to each location. Identify which of your solutions listed in $($a$)-($d$)$ no longer work.