11. (12 pts) Write a function called seesti), which makes a "deep copy or complete copy of one singly linked list. The copy must contain the data in the same order as the original list. The function should accept two parameters: a pointer to the source list and a pointer to the copy list. You need to decide if the pointers are single indirection (*) or double indirection (**). The function should not return a value. Note: a "deep" copy implies that new dynamic memory is allocated for each node in the copy list. You should NOT just do the following: Gervlist = souscelisti You may not assume that a maleode) function exists. Assume the following node definition: ef struct node int data; struct node eest; 3 Node; Be sure to write out the function header! 11. (12 pts) Write a function called seesti), which makes a "deep copy or complete copy of one singly linked list. The copy must contain the data in the same order as the original list. The function should accept two parameters: a pointer to the source list and a pointer to the copy list. You need to decide if the pointers are single indirection (*) or double indirection (**). The function should not return a value. Note: a "deep" copy implies that new dynamic memory is allocated for each node in the copy list. You should NOT just do the following: Gervlist = souscelisti You may not assume that a maleode) function exists. Assume the following node definition: ef struct node int data; struct node eest; 3 Node; Be sure to write out the function header