Could you answer this question in C++ programming language as soon as possible and please add the screen shots of code.

Thanks in advance..

Write the program, which implements Dijakstra algorithms: Menu of the program: 1. Load out data from the input file (weighted graph with n vertices and m edges and the inital vertex s) 2. Dijakstra Algorithm 3. Safe the input data in the output file (the shortest n-1 paths from the initial vertex s to the other vertices) Examplary file Input: 58 // the number of vertices and edges 1 // the initial vertex 12 7 // the initial, the final vertex of the edge, the weight of the edge 134 146 151 322 3 45 42 3 5 41 Output: 1-5-4-2 5 \the shortest path from 1 to 2 with the cost 5 1-3 4 \\ the shortest path from 1 to 3 with the cost 4 1-5-4 2 \\ the shortest path from 1 to 4 with the cost 2 1-5 1 \\ the shortest path from 1 to 5 with the cost 1