Problem 2-2. (35 points) Let G=(V, E) be a directed acyclic graph with cost on the edges. Let p be a path in G. The marimal link in p is the maximum cost of any edge in p. Give an efficient dynamic programming algorithm for the following problem. Given a directed acyclic graph G = (VE) with cost on the edges and vertices 8,t EV, find a path p from s to t that has minimum maximal link. That is. among all paths from s to t, we want the one whose maximal link is smallest. The algorithm must return such a path as well as its maximal link. What is the running time of your algorithm? You can assume that the input is given in the adjacency matrix form