Question 1: George is camped deep in the jungle, and he wants to make his way back to the coast and civilization. Each of the paths he can take through the jungle has obstacles that can delay him, including hostile natives, wild animals, dense forests and vegetation, swamps, rivers and streams, snakes, insects, and mountains. Following is the network of paths that George can take, with the time (in days) to travel each branch: George's Camp 2 13 2 3 11 15 3 4 5 8 1 5 3 Coast 17 5 12 3 2. 16 7 2 10 3 5 14 6 Determine the shortest (time) path for George to take and indicate the total time. Use integer programming to solve this problem.