You may solve the problems using your choice of software, state which software package/language(s) you used and provide the code or spreadsheet. Can this be done using a spread sheet? I would prefer that.

Shortest paths can be cast as an LP using distances dv from the source s to a particular vertex v as variables. . We can compute the shortest path from s to t in a weighted directed graph by solving. max dt subject to ds = 0 dv du w(u.v) for all (u.v)EE . We can compute the single-source by changing the objective function to max 2vev dv Use linear programming to answer the questions below. State the objective function and constraints for each problem and include a copy of the LP code and output. a) Find the distance of the shortest path from G to C in the graph below b) Find the distances of the shortest paths from G to all other vertices. 5 10 18 4 10 9//25