Problem 1 (6 points)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. Use linear programming to answer the questions below. State the objective funct...
AIC2100 AI Programming with PythonLab 5 AIC2100 2You must follow the specifications thoroughly!• Any typos (including whitespace and linebreak) will result in a point deduction.• If you’re asked to write the comment or docstring, you must add them.• If some Python libraries are prohibited, import...