Use C program write a function ( Node *duplicate_list(Node *head) ).

Here is the output

The function duplicate_list should create a new list on the heap that is a duplicate of the input list provided as an argument. The duplicate list should have the same number of nodes as the input list, and each node at each position in the list should have the same value as the node in the input list at that position in the input list. The function should return a pointer to the head of this new list. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 #include #include #include #include typedef struct node { int value; struct node *next; } Node; void print_list(Node *head); Node* insert_at_head (Node *head, int new_value); Node *duplicate_list(Node *head); int main() { 18 19 20 21 22 23 24 25 printf(" duplicate_list test "); printf(" ** "); Node *list7 NULL; for (int i = 0; i value new_value; new_node->next NULL; if (head NULL) return new_node; else { new_node->next head; return new_node; } } void print_list(Node *head) { Node *current; current = head; int i = 0; while (current != NULL) { printf("Node %d: %d ", i, current-value); current = current->next; i++; } } 48 49 50 51 52 duplicate_list test List 7... Node 0: 9 Node 1: 8 Node 2: 7 Node 3: 6 Node 4: 5 Node 5: 4 Node 6: 3 Node 7: 2 Node 8: 1 Node 9: 0 List 7 duplicate... Node 0: 9 Node 1: 8 Node 2: 7 Node 3: 6 Node 4: 5 Node 5: 4 Node 6: 3 Node 7: 2 Node 8: 1 Node 9: 0