Implement in C programming.

The function that you need to complete is called insertAfter that gets three parameters as seen below. The first parameter (i.e. head) is a pointer to the head of the list, the second (i.e. current) is the integer data that is in a node after which the new node is inserted, and third is the data that is to be added to the list. Node* insertAfter (Node* head, int current, int data) It is possible that the given 'current' data does not exist in the list. In this case the new node should be added to the head of the list. In case more than one 'current' data exists in the list, the new node should be added after the first occurrence of current' data. The function returns the address (pointer) of the head node