Project Description Algorithm Design Source Code Output (Screen Shots) Result Analysis Page bre 1/3 Data Structure Project 4: Dijkstra's Algorithm Dijkstra's Algorithm provides a very effective solution for finding shortest path from a source node to all the other nodes. Please write a program in C language to implement this algorithm. Source Code for Reference 1/ Program of shortest paths from a source node to all other nodes // in a weighted graph using Dijkstra's Algorithm #include # #define N6 #define N9 #define Infinity Ox 7ARTY void Dijkstra(int n, int adjMatrix(IN], int source, int prev[], int dist[D: void printShortestPath(int dest, int source, int prev[N], int dist[N]: int main int source 0; /*int adj Matrix[N][ N-( 0.6, 5,0,0,0, 0,0,3,0,3,2, 0,0,0,2,0, 3. 0,0,0,0,0,1. 0, 0, 0, 4,0,0. 0,0,0,0,3,0 ). int adj Matrix[N][N) - 0,36, 1,15,0,0,0,0,0. 0,0,0,0,0,0,14,0,0, 0,33,0,11,31,0,0,0,0, 0,0,0,0,0,8,0,0,0, 0,7,0,0,0,0.12,0,0, 0,0,9,0,10, 0, 0, 5.0. 0,0,0,0,0,0,0,0.13, 0,0,0,0,3,0,16,0,30, 0,0,0,0,0,0,0,0,0 ): int prev[N], dist[N]: Dijkstra N, adj Matrix, source, prev, dist); void Dijkstra(int n, int ad Matrix[N][N], int source, int prev[N], int dist[N]) intij.min Weight, mint temp,finish[N]: for(i=0; i > finish(minID-1: printShortestPath(minID, source, prav, dist); for (-0, j