C programming language

(Linked Lists) Consider typedef strut node ( 5. char name [201 struct node *next; Node; Write a C function with the following prototype Node *find (char *name, Node *head, Node *tail) where name is a string, head points to the first node of a linked list and tailpoints to the last node of the linked list. The function returns the address of the first node whose name is equal to the string in name. It returns NULL if no node of the linked list contain name. No standard library function is allowed except those for strings