Linked list is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; but the elements are linked using pointers.

Write a C program that you implement a $$doubly$$ linked list representation of a contact record database application. Check the provided record structure. You are asked to use this data structure in this exercise. Here is the expected behavior of your program.

$[20$ points$]$ The record application should have $4$ modes plus a quit mode. These four modes are add a new record, delete a record, list all records and find a record by name. Four modes of operation should update the necessary fields of the data structure.

$-$ add a new record, $[-]$ delete a record, $[-]$ list all records, $[-]$ find a record by name

$[7$ points$]$ If there is an input datafile given by the command line, it should read first the available records in the datafile. Note that data is stored using the structure record, hence start reading with the first node until a NULL pointer in final node is achieved.

$[8$ points$]$ At every iteration, you are expected to print the options until user wants to quit by typing a $$Q$$ or $$q$,$ which is provided. At quit step the records should be written to a datafile, i$.$e$.,$ quit mode $($to save and exit the program$).$ The program should write the record database to a new $.$txt$$ file call it $$datafile$.$txt$.$