In this project, you need to implement a Course Prerequisite Planner and Campus Route Finder application in C programming language, with the following tasks:

Implement the required code to assist the $1^{st}$ year students to find the shortest path between specific buildings using Dijkstra algorithm by reading the required information from the input$\_$buildings.txt file, the file must initially have the information in the table below, but you can add more buildings and their distances in the file.

$\backslash$table$[[$ direction,Masri,Aggad,A$.$Shaheen,Bamieh,AL$.$Juraysi,Alsadik,KNH$,$Sh$.$Shaheen$],[$Masri$,,,70,39,,,155,78],[$Aggad$,,,,,71,52,43,],[$A$.$Shaheen,,$60,,,89,,,40],[$Bamieh$,,139,,,,,77,33],[$AL$.$Juraysi,,,,,,,,$],[$Alsadik$,,,,,57,,,],[$KNH$,,,,,67,,,],[$Sh$.$Shaheen,$90,,,120,140,104,,]]$

input$\_$buildings.txt: contains for example contains some buildings, but you can add more buildings.

$q,$

You must fill in the file with all distances between buildings.

Then you can use either contingency matrix or contingency list to represent the graph and store it in your program. The user inserts two buildings, then the application will find the shortest route between them, prints the total distance and the route between the two buildings.

$2.$ Implement the required code to assist the $1^{st}$ year students in computer engineering to sort the courses they must take using topological sort. The application must load the courses from the input$\_$courses.txt file, where this file will contain the courses listed in the table below:

$\backslash$table$[[$Course$,$Prerequisites$],[$COMP$2310,$COMP$133],[$COMP$2421,$COMP$133],[$COMP$333,$COMP$2421],[$COMP$433,$COMP$333],[$ENCS$2340,$COMP$133],[$ENCS$2380,$ENCS$2340],[$ENCS$3130,$COMP$133],[$ENCS$3310,$ENCS$2380],[$ENCS$3340,$COMP$233$ and COMP$133],[$ENCS$4320,$COMP$233$ and COMP$133]]$

input$\_$courses.txt: contains the list of courses and their pre$-$requisite, below is an example.

COMP$2310$# COMP$133$

ENCS$3340$# COMP$233$# COMP$133$

You have to fill in the file with all courses and their pre$-$requisites $.$

Upon request, the application sorts the courses using topological sort and saves them internally in the program. So$,$ the user can print them on request.