Need this in C please!

#include #include #include #include #include #include #include typedef struct LinkedListNode LinkedListNode;

struct LinkedListNode{ int val; LinkedListNode *next; };

LinkedListNode* _insert_node_into_singlylinkedlist(LinkedListNode *head, LinkedListNode *tail, int val){ if(head == NULL) { head = (LinkedListNode *) (malloc(sizeof(LinkedListNode))); head->val = val; head->next = NULL; tail = head; } else { LinkedListNode *node = (LinkedListNode *) (malloc(sizeof(LinkedListNode))); node->val = val; node->next = NULL; tail->next = node; tail = tail->next; } return tail; }

/* * Complete the function below. */ /* For your reference: LinkedListNode { int val; LinkedListNode *next; }; */ LinkedListNode* removeNodes(LinkedListNode* list, int x) { }

int main() {

FILE *f = fopen(getenv("OUTPUT_PATH"), "w");

LinkedListNode* res;

int _list_size = 0;

int _list_item;

LinkedListNode* _list = NULL;

LinkedListNode* _list_tail = NULL;

scanf("%d ", &_list_size);

int _list_i;

for(_list_i = 0; _list_i

scanf("%d", &_list_item);

if(_list_i == 0) {

_list = _insert_node_into_singlylinkedlist(_list, _list_tail, _list_item);

_list_tail = _list;

}

else {

_list_tail = _insert_node_into_singlylinkedlist(_list, _list_tail, _list_item);

}

}

int _x;

scanf("%d", &_x);

res = removeNodes(_list, _x);

while (res != NULL) {

fprintf(f, "%d ", res->val);

res = res->next;

}

fclose(f);

return 0;

}

Complete the removeNodes function provided in your editor. It has 2 parameters list: A reference to a LinkedListNode that is the head of a linked list 2. x: An integer value. Your function should remove all nodes from the list having data values greater than x, and then return the head of the modified linked list. Input Format The locked stub code in your editor processes the following inputs and passes the necessary arguments to the removeNodes function The first line contains N, the number of nodes in the linked list. Each line , where 0 s ,