INPUT:  Your program will read an undirected graph representation from a file called graph.txt (text file). The first line contains a number, which is the number of vertices (n). We assume the vertices are 1,2,3,…, n The second line will show 2 distinct numbers between 1 and n. After these 2 lines, there will be the edges listed in separate lines with three numbers: The first two numbers represent the edge ends (undirected graph), while the third number is the weight for that edge. For example, the graph in Figure 8.4.7 is represented as follows: 6 16 122 141 233 251 451 362 562 The  program will implement the Dijkstra’s Algorithm and OUTPUT [the shortest path] and [the total weight] between the 2 vertices in line 2, e.g., for the graph above it should output: [1,4,5,6] [4]