Thk chalknge is part of a tutortal track by MyCode5chool and is axcompanled by a vidoo lesson. case, return a null value. Example llist=0123 position =2 After remowing the node at position 2 . Mist =013. Function Description Complete the deleteNode function in the editor below. deleteNode has the following parameters: - SinglylinkedListWode pointer llist: a reference to the head node in the list - int position: the position of the node to remove Returns - SinglylinkedList Node pointer: a reference to the head of the modified list Input Format The first line of input contains an integer n, the number of elements in the linked list. Each of the next n lines contains an integer, the node data values in order. The last line contains an integer, position, the position of the node to delete. Constraints - 1data - node_data; this->next - nutlptr; \}. ; class singlyLinkedList \{ public: SinglyLinkedListNode *head; SinglyLinkedListNode *tail SinglyLinkedList() \{ this head - nullptr: this tail - nullptr \}. void insert_node(int node_data) i SinglylinkedListNode* node - new singlyLinkedListNode(node_data); if (!this-shead) i this->head - node; f else \{ this tail next - node; \} this tail - node; \} void print_singly_linked_List(SinglyLinkedListNode* node, string sep, ofstream\& fout) \{ while (node) \{ fout data; node - node-rnext if (node) \{ fout next; free (temp) \} free(temp); int main( ) of stream fout(getenv("OUTPUT_PATH")); SinglyLinkedList* Llist - new SinglyLinkedList(); int Llist_count; cin > Llist_count; cin.ignore (numeric_limits:tmax (), 'n'); for (int 10;1insert_node(Llist_item); \} int position; cin > position; cin.ignore(numeric_limits::max(), 'n'); SinglyLinkedListNode* Llist1 - deleteNode(Llist->head, position); print_singly_Linked_List(llist1, " ", fout); fout "\} \backslash n ^ { " \prime } \text { ; } free_singly_linked_list(llist1); fout.close (); return 0