Let G = (V, E) be a directed graph and let w : E R be a weight function. For a path P from u to v we define the chokepoint of P to be the weight of an edge with smallest weight min eP {w(e)}. For two vertices u and v we define the chokepoint from u to v to be the maximum, over all paths P from u to v, of the chokepoint of P. (If there is no path from u to v, then we can define the chokepoint from u to v to be the undefined symbol .) Design an algorithm that takes as input G, w, and a source s, and computes the chokepoint from s to v for every vertex v V . Prove the correctness of your algorithm and analyze its running time.