Write an improved version of the code to do the following:

$$ Change the linked list to be doubly$-$linked: each node X has a pointer to the node

after node X and to the node before node X$.$ A pointer root points to the head of

the queue and a pointer end points to the tail of the queue.

$$ Every new line read from the file is stored in a new node which is inserted at the

head of the linked list $($as in the original code$).$ Pointer root points to the node with

the last line read so far.

#include

#include

#include

struct node

$\{$

char info$[256]$;

struct node $*$ next;

$\}$;

int main $($int argc, char $*$ argv$[])$

$\{$

FILE $*$ fp;

char line$[256]$;

struct node $*$ root;

struct node $*$ new$\_$node;

struct node $*$ p$,*$q;

if $($argc $==1)$

$\{$

printf $("$Error$,$ no file provided.

$")$ ;

return$(0)$;

$\}$

fp $=$ fopen $($argv$[1],"$r$")$ ;

if $($fp $==$ NULL$)$

$\{$

printf $("$Error$,$ file not found.

$")$ ;

return$(0)$;

$\}$

root $=$ NULL;

while $($fgets $($line$,256,$ fp$)!=$ NULL$)$

$\{$

new$\_$node $=$ malloc $($sizeof $($struct node$))$ ;

strcpy $($new$\_$node $->$ info, line$)$;

new$\_$node $->$ next $=$ root;

root $=$ new$\_$node;

$\}$

for $($p $=$ root; p $!=$ NULL; p $=$ p $->$ next$)$

$\{$

printf $("\%$s$",$ p$->$info$)$ ;

$\}$

for $($p $=$ root; p $!=$ NULL; p $=$ q$)$

$\{$

q $=$ p $->$ next;

free$($p$)$;

$\}$

return$(0)$;

$\}$