Data structure 24

a. Consider a singly linked list with its node structure defined as below. typedef struct node *node_pointer typedef struct node fint id; node_pointer link; ); The given procedure deletel) below deletes a given node Q preceded by node P in a singly linked list *ptr. Write the codes for procedure delete2(..) to delete a node Q without a given preceding node. State the complexity of delete2(.) and identify any limitations of singly linked lists. void delete2 ((list_pointer *ptr, list_pointer Q) [/ to define the body of procedure to delete node Q from a singly linked list *ptr \ void deletel (list_pointer *ptr, list_pointer P, list_pointer Q) {if (P) P-link - Qlink; else *ptr*ptr) >link; free (Q))