3. (20 pts) For a directed graph with positive weights, we define the max-weight of a path from s to d as the maximum of the link weights along the path. Give an algorithm to compute the smallest max-weight paths from a source vertex s to all other vertices, and prove its correctness. (Hint: Your algorithm should be a modification of Dijkstra's algorithm.)