1. the objective function (include only the first 2 and last 2 entries with in between) for minimizing the total delivery time.

2. the constraint for node 4

3. the constraint for node 1

4. the constraint for node 9

How long would it take the delivery if the delivery went from nodes 1 to 3 to 5 to 6 to 9?

With restaurant owners being restricted to serving customers in their dining rooms, many are existing through their take-out business and using delivery services to deliver their food to their customers. But, good delivery services survive by delivering their orders as quickly as possible. Suppose one such service relies on management science, more specifically the shortest-route model to determine the quickest route for delivering a customer's take-out order. The following mapindicates the better routes that can be followed from a particular restaurant to a particular customer with node 1 indicating to location of the restaurant, node 9 indicating the location of the customer's home and the values along each of the routes' segments indicating the expected travelling time (in minutes) along each of these segments.. 2 8 9 7 6 9 6 5 9+ 1 5 3 9 7 6 4 7 8 8 Using X's as your decision variables where i represents the node where the delivery is coming from and j represents the node where the delivery is going to, formulate the following