Suppose you are given a graph G with cj representing cost of the edge (i, j). Suppose the "cost" of a path P is the cost of the most expensive edge in the path. (Thus, we do not add the cost of the edges in the path, but simply pick the maximum edge in the path.) How will you find a cheapest path from s to t in this graph using dynamic programming? (Use the following idea: let f(k,j) be the cheapest path from s to j using at most k edges. Show how you will initialize f(1,j) for all nodes j; then show how you can compute f(2,j) for all nodes j, etc. The answer you're looking for is f(n – 1,t))