Project Requirements and Implementation ExplanationThe project requires implementing a Course Prerequisite Planner and Campus Route Finder application in C Write me the full code plese programming language, with the following tasks:Task $1$: Implement Dijkstras Algorithm to Find the Shortest Path Between Buildings$1.$Input File $($input$\_$buildings.txt$)$:This file contains building names and distances between them. The file must initially have the information in the table provided but can be extended with more buildings and distances.Example Content:Masri#A$.$Shaheen#$70$A$.$Shaheen#Aeqad#$602.$Graph Representation:You can use either an adjacency matrix or adjacency list to represent the graph$\mathrm{.}3.$Dijkstras Algorithm Implementation:Read the file input$\_$buildings.txt and build the graph data structure.Implement Dijkstras algorithm to find the shortest path between two buildings.The user inputs the names of two buildings, and the program prints the total distance and the route between them.Task $2$: Implement Topological Sort to Sort Courses Based on Prerequisites$1.$Input File $($input$\_$courses.txt$)$:This file contains the list of courses and their prerequisites.Example Content:COMP$2310$#COMP$133$ENCS$3340$#COMP$233$#COMP$1332.$Topological Sort Implementation:Load the courses from the file input$\_$courses.txt$.$Sort the courses using topological sort and save them internally in the program.Print the sorted courses upon request.Application MenuYour application must have the following menu:$1.$Load the two files$\mathrm{.}2.$Calculate the shortest distance between two buildings$\mathrm{.}3.$Print the shortest route between two buildings and the total distance$\mathrm{.}4.$Sort the courses using the topological sort$\mathrm{.}5.$Print the sorted courses$\mathrm{.}6.$Exit the application.