Giving the following:

typedef node Node;

struct node{

int data;

Node* next;

};

1. Write a function called destory that takes a Node pointer to head of a list and will free up the memory associated with each node in entire list.

2. Write a recursive function called sum that given a Node pointer to the head of a list will return the sum of all data in the linked list.

3. Write a function called copy_list that, given a Node pointer to the head of a list will return a Node pointer containing the address of the head node of a new list that is an exact copy of the oranginal list. Your copy should be independent of the first list and not share any nodes. You may write an iterative or recursive version of your function.