Let G = (V,E) be a directed weighted graph such that all theweights are positive. Let v and w be two vertices in G. Design analgorithm to find the shortest path from v to w that containsexactly k edges. K will be a number less than the number ofvertex.
Expert Answer
An answer will be send to you shortly. . . . .