Dijkstras Algorithm: show a C code about 'finding the shortest path from the single source to all the other vertices in G(V,E) here are some condition we must satisfy. 1. V has 100 vertices (x, x^2 mod 100) where x=1,2, ...,100 e.g. (1.1), (2,4), (3,9), ...(30,0), ... 2. E is defined as if d<= 13 between v and w, then edge(v,w) exists if d> 13 between v and w, then edge(v,w) does not exists 3. the start poin(single source) is (1,1). also find the adjecent edges and thier weights, use heap and print it as linked list