Fill the gap by using C.

Thanks

1 2 #include #include 4typedef struct nodet int key; struct node* next; 7 node-t; 9 typedef node_t node_ptr; 10 11 void mainO 12- 1 13 14 15 16- 17 18 19 20 21 node-ptr p-NULL; node-ptr listhead = NULL; FILL THE GAP: Create a listhead with key 1,2,3,...,10 Make sure next pointer is pointing to the *next node 23 24 25 26 27- 28 29 30 31 32 FILL THE GAP: *Delete node with key 5 6 and 7 in that order FILL THE GAP * Insert a new node with key 6 35 36 37 38 39 41 42 43 * Traverse the list and print the key p - listhead; if(p NULL) 45 printf("List empty return; 47 48 49 50 51 52 53- 54 /* traverse and print key* while( p->next !=NULL) printf("%d ", - p->next; p->key); 56 57 58 59 60 61 printf("%d ", p->key)