Write a Java program for Dijkstra's algorithm for shortest path using Lab-11:Exercise\#2 as base code to start with. Improve the base code to modify it for: - Input the Edges (u,v,w) from user where triplet represents the undirected edge from vertex u to vertex v having weight w. - Find the shortest path from first node as source to all other nodes as destinations. Hint- You need to modify only the main method. Sample run of the program Enter The number of edges 3 Enter the values for edge 0 Enter The values of U 0 Enter The values of V 1 Enter The values of W 10 Enter the values for edge 1 Enter The values of U 1 Enter The values of V 2 Enter The values of W 10 Enter the values for edge 2 Enter The values of U 0 Enter The values of V 2 Enter The values of W Enter the values for edge 1 Enter The values of U 1 Enter The values of V 2 Enter The values of W 10 Enter the values for edge 2 Enter The values of U 0 Enter The values of V 2 Enter The values of W 15 Path (01) : Minimum Cost =10 and Route is [0,1] Path (0>2) : Minimum Cost =15 and Route is [0,2]