- Write a function that will destroy a linked list. - Write a function that will insert an element at the head of a linked list. - Write a function that will insert an element at the tail of a linked list. - Write a function that will form the union of two linked lists. You need two different linked lists to show that this function works. - Write a function that will take two lists and form the intersection of two lists. - Write a function that will find the maximum and the minimum last names in a linked list. The maximum value is returned.