need add_node_at_head

struct word_entry char unique_word // be sure to malloc exactly enough space to hold the string for the word include the 0'. int word_count ; // The number of times this word occurs in the input document (by definition at least one). struct node struct word entry one_word// a word we have seen at least once with the number of occurrences. struct node xp_previous/ set to NULL if this node is the first in the list. struct node *p_next; // set to NULL if this node is the last in the list struct linked_list struct node *p_head struct node *p tail struct node *p_current// points to the most recently added or accessed record. NULL if the list is // points to the first node in the list. NULL if the list is empty // points to the last node in the list. NULL if the list is empty empty. // Inserts a node at the beginning of the linked list. // Updates the passed set of pointers as needed based upon the addition that was done. // It checks that p list is not NULL.Checks that word is not NULL and is not an empty string. // Returns 0 for failure if either word test fails. // Also on failure no change is made to the pointers in p list. // On success it returns a 1 and updates at least the passed p head and p_current members of p list. // p head and p_current will always point to the newly added node. // When adding the first node to an empty list p tail will also point to this same new node since it is the only node. // Hint: use the create_node function to actually create the node. // Hint: be sure to maintain both the p previous and p_next pointers in each node. int add_node_at_head struct linked_list *p list, char *word) return -1/ REMOVE THIS and replace with working code