We are given a weighted graph G = (V, E) with weights given by W. The nodes represent cities and the edges are (positive) distances between the cities. We want to get a car that can travel from a start node s and reach all other cities. Gas can be purchased at any city, and the gas-tank capacity needed to travel between cities u and v is the distance W[u, v]. Give an algorithm by modifying Edge Relaxation to determine the minimum gas-tank capacity required of a car that can travel from s to any other city. For this problem, just show your modified version of the Edge Relaxation operation or function; do not provide anything else (e.g., pseudocodes of your entire algorithm). [6 points]