Using C, write a program that uses the Dijkstra's shortest path algorithm with the vertices/nodes being the buildings in a College campus, and the edges being the paths from every building to every other(lets say we have 40 building in total, 30 are residential buildings and 10 are academic buildings for classes). We want to find the shortest paths from the residential buildings to the academic buildings in order to get to class the fastest.