Consider the shortest path problem.
(a) explain the problem statement.
(b) consider dijkstra’s algorithm that solves the problem in part (a). prove the optimality of the result obtained by dijkstra’s algorithm.
(c) does dijkstra algorithm work if we allow negative edge costs? explain.