Reverse linked list in every K node, void function

Reverse Every K Nodes You are given a singly linked list. Every k nodes form a segment. If the last few nodes are less than K, then you can ignore them. Write a reverseKnodes() which reserves every segment in the linked list. 1 The function prototype is given as follow: 2. void reversekNodes(ListNode** head, int k); 3 Input format: The 1st line is the k The 2nd line is the data to create the linked list and ends with a non-digit symbol Example: Input: 3 1 2 3 4 5 6 7 8 9 10 a Output: 32 16 5 4 9 8 7 10