I need help. Thank you so much. C or C++ programming about algorithms.

Algorithms Assume the following weighted graph is given. To find the shortest path from a node (given as input) to another node (again provided as input by user) we want to use Dijkstra's algorithm 1 Use adjacency matrix to store the graph. 2- Check if the two nodes are connected (the destination node is reachable from the source node) 3- Find and print the shortest path Please submit your source code (in C/C++) with comments on each part of the code V7 7 Vs 4 13 12 V3 Ve