Please answer using linear programming. Use EXCEL and post your spreadsheet and constraints. I can solve a shortest path problem on my own, but I'm not sure how to do so while using EXCEL so please follow these specifications. Thanks.

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 s wuv) for all (uv)cE We can compute the single-source by changing the objective function to max Evev div 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 A10 18 9 10 9//25