Using C, write a program that uses the Dijkstra's shortest path algorithm that finds the shortest length from a building 1(the source) to a building 20 (the destination) in a College campus. lets say we have 20 buildings in total, We want to find the shortest paths from the residential building number 1 to the academic building number 20 in order to get to class the fastest.The buildings are in a order of their numbers.