Complete the following three linked list functions according to the provided specifications. use full c code. you may use the ll-node. h and ll. h files online as starting points in all cases, you should assume that a linked list data type is composed of two fields, a pointer to the head node, a pointer to the tail node, but both null if empty. each node contains two fields: its value data and a pointer to the next node in the chain. assume all linked lists and node sequences are valid. sample suppose we have the following input list l l: 17 head: 42 36 48 14 36 null tail: a) complete the function spliceinto (l, x, i) which inserts the integer x into index location i of list i.. if location i length of list 1, then it appends node containing x at the end. for example: 53 spliceinto (l, 53, 4) head: 42 36 14 17 ая 36 null tail: // post: inserts node with data x into location i of list l int i) void spliceinto (ll_t l. int x, b) complete the function reverse (l) which reverses the list l. for example: submit written parts (q1,2,3) in csil dropbox, electronic parts (q3) on coursys reverse (l) : 48 head: 36 36 17 14 42 null tail: // post: void reverse (ll_t nodes of list l are now reversed l) c) complete the function removenumber (l, target) which removes (all instances of) the target from lif target is found in 1 and does nothing otherwise. if successfully removed, return 0. otherwise, return 1. // post: removes data target from list l unsigned int removenumber (l1_t l, int target) d) complete the function numberofevens (l) which counts the number of even numbers in i and returns that number. in our list, the answer would be 5. returns the number of even numbers from list l // post: unsigned int numberofevens (ll t l) complete the function merge (l1, l2) which is the merge function for two lists l1 and l2. you may assume that l1 and l2 are in sorted order. upon return, the list l1 will contain the el merged list, l2 will be freed // pre: l1 and l2 are ordered linked 1lists // post: l1 contains the merged (ordered) list of l1 and 12, 12 is freed void merge (ll t l1, ll t l2)( for example, given 11 null 62 32 4t head tail : 12 3 nell 1p 11 head tail the result of the merge should be as follows: merge (l1,l2) 11: 33 32 19 17 1 14 head: tail: null 52 55 48 48 36 35 l2: