To reduce the complexity, we will assume that items can flow only from nodes with lower numbers to nodes with higher numbers. This assumption applies to all three problems in this homework.

Problem $1$

The Burger Doodle restaurant franchises in Los Angeles are supplied from a central warehouse in Inglewood. The location of the warehouse and its proximity, in minutes of travel time, to the franchises are shown in the following network:

Trucks supply each franchise on a daily basis.

Determine the shortest route from the warehouse at Inglewood to each of the

$1$

nine franchises. $($In this problem, please clearly indicate the permanent set, branch, and time at each step.$)$Can you draw out to show how u get the answer