Complete the program by writing the missing code for list insert.

$1$

$/*$

$*$ same output as $11-$linked$-$list.c$,$ but

$*$ uses list$\_$insert$().$ note that list$\_$insert$()$

$*$ is called in reverse order

$*/$

#include

#include

#include

#define LEN $3//$ airport code len

struct node $\{$

char code$[$LEN$+1]$;

struct node $*$next;

$\}$;

void list$\_$insert$($char $*$s$,$ struct node $**$start$)$;

void list$\_$print$($struct node $*$p$)$;

int main$($void$)$

$\{$

struct node $*$head $=$ NULL;

list$\_$insert$("$BKK$",$ &head$)$;

list$\_$insert$("$PNH$",$ &head$)$;

list$\_$insert$("$SGN$",$ &head$)$;

list$\_$print$($head$)$;

return $0$; $\}$

$/*$ insert node at beginning of list $*/$

void list$\_$insert$($char $*$s$,$ struct node $**$start$)$

$\{$

$//$ missing code goes here

$\}$

void list$\_$print$($struct node $*$p$)$

$\{$

while $($p $!=$ NULL$)\{$

printf$("\%$s

$",$ p$->$code$)$;

p $=$ p$->$next;

$\}\}$