Exercise 12.5 Let G = (V, E) be a weighted, directed graph with positive integer weights and marimum weight W. %3D (a) Modify Dijkstra's algorithm to compute the shortest paths from a given source...

Extracted text: Exercise 12.5 Let G = (V, E) be a weighted, directed graph with positive integer weights and marimum weight W. %3D (a) Modify Dijkstra's algorithm to compute the shortest paths from a given source verter s in O(W|V|+|E|) time. (b) Give an O(|E| lg W) time algorithm for the problem by improving your algorithm of part (a).