Given a graph, cost of traveling in a path is the max edge weight that appeared in that path. Find the min cost taken to reach from 1 to n. You can only include k edges in the path. Please let me know if you find the same question anywhere, It's the question from UIPath's Online assessment test.