The National Human Trafficking Hotlines mission is to provide human trafficking victims and survivors with access to critical support and services to get help and stay safe, and to equip the anti-trafficking community with the tools to effectively combat all forms of human trafficking. To raise awareness of this valuable resource, a nonprofit plans to place flyers with information about the hotline around town. The nonprofit has identified four venues to distribute the flyers: a local hospital, the airport, a homeless shelter, and a downtown bar. City restrictions currently state that a total of 5 flyers can be distributed around town.

Based on the impact of similar awareness campaigns in a similar town, the nonprofit has estimated the number of additional calls the hotline will get depending upon the number of flyers distributed in each venue. The estimates are as follows:

--> Use dynamic programming to determine how to best distribute the flyers among the four venues to maximize the estimated number of additional calls to the hotline. How many additional calls are estimated with the optimal solution? Clearly identify the stages, states, decision variables, decision benefit function, and boundary condition.

--> Use dynamic programming to find all of the shortest paths through the network:

Number of Flyers Venues Homeless Shelter Hospital Aiont Bar 0 c) 0 4 10 12 14 16 4 12 15 10 12 Number of Flyers Venues Homeless Shelter Hospital Aiont Bar 0 c) 0 4 10 12 14 16 4 12 15 10 12