This assignment: route$\_$manager.c$,$ using C$\text{'}$s heap memory

You are to write an implementation of route$\_$manager in C such that:

a$)$ Based on provided arguments and data file $($i$.$e$.,$ dataset$),$ route$\_$manager will help us answer the

first three questions from A $2$ :

q$1$: What are the top N airlines that offer the greatest number of routes with destination

country as Canada?

q$2$: What are the top N countries with least appearances as destination country on the

routes data?

q$3$: What are the top N destination airports?

However, this time N is an input provided by the user.

b$)$ Similarly to A$2,$ after each execution, your program must produce a file named output.csv that

represents the answer to the question asked to program $($i$.$e$.,$ arguments passed$).$

c$)$ You need to allocate storage on the heap dynamically to solve this assignment. Dynamic data

structures must be used in the form linked$-$list manipulation routines $($i$.$e$.,$ using only arrays is not

permitted for this assignment$).$

d$)$ The program itself consists of several C source files and a makefile for build management:

emalloc$[.$c or $.$h$]$: Code for safe calls to malloc, as is described in labs $\backslash$lectures$,$ is available

here.

list$[.$c or $.$h$]$: Type definitions, prototypes, and codes for the singly$-$linked list

implementation described in labs$/$lectures$.$

makefile: This automates many of the steps required to build the route$\_$manager

executable, regardless of what files $(.$c or $.$h$)$ are modified. This file can be invoked using

the Bash command make.

route$\_$manager.c: The main file of the program.