use java

2. The following function creates a copy of a linked list. Do you see any problems, if yes, fix them. public Linked List Copy) //this function is called from main like { // Linked List another = mylist.Copy(); Linked List output = new LinkedList(); while(head != null) { output.AddHead(head.value); head = head.next; } return output; ] 3. What will be the output if we call the following function MyFun on the given linked lists. a) head->2-1->3->9->5->3->7->4->null b) head->1->2->3->4->5->6->7->null public void MyFun() { Node h = head; whileh != null) { System.out.print(h.value+"=>"); h = h.next next; } } 4. Write a member function without calling any other function that deletes every alternating node linked list. So let's say if the input linked list is: head->2->6->1->9->3->4->8->7->null Then calling your function will yield: head->6->9->4->7->null