write c code:

1:void freeNode(struct node*){}

2:void addNode(struct node*){}

3:void removeNode(struct node*){}

Scenario: C Programming Review [0 points] 11. (BONUS PRACTICE QUESTION) The following declaration of a struct is used to represent a node in a linked list of grades. struct node f int value; char assignment [255]; struct grade_node* next; In order to speed up a program which uses this node struct, you have been asked to implement a oled memory allocator for it. Complete the void freeNode(struct node*) function shown below. This function should do the equivalent of C's standard free, but in terms of a memory pool. Assume that there is a global variable called pool_head which stores the nodes in the memory pool, and a variable -called pool_size hich stores the number of allocations in the pool. Enforce that the pool may contain a maximum of 16 allocations. [4 points] struct node* pool-head NULL; //value will change during execution int pool_size 0; //value will change during execution void freeNode (struct node) f