This challenge is part of a tutorial track by MyCodeSchool and is accompanied by a video lesson. Change Them You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: - SinglyLinkedListNode pointer head: a reference to the head of a list - int data: the data value for the node to insert Returns - SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer n, the number of elements in the linked list. The next n lines contain an integer each, the value that needs to be inserted at tail. Constraints - 1n1000 - 1 list i1000 Sample Input STDIN Function _ - 5 size of linked list n = 5141 linked list data values 141..474302164530474 Sample Output 141 302 164 530 474 Explanation First the linked list is NULL. After inserting 141, the list is 141 NULL. After inserting 302 , the list is 141302 NULL. After inserting 164 , the list is 141302164 NULL. After inserting 530 , the list is 141302164530 NULL. After inserting 474 , the list is 141302164530474 NULL, which > \#include ... // Complete the insertNodeAtTail function below. / * For your reference: * SinglyLinkedListNode \{ * int data; * SinglyLinkedListNode* next; } */ SinglyLinkedListNode* insertNodeAtTail(SinglyLinkedListNode* head, int data) \{ L. 63> int main()|