P1 is below

package p6_linkedList;

import java.util.*;

public class LinkedList

{

public Node header;

public LinkedList()

{

header = null;

}

public final Node Search(int key)

{

Node current = header;

while (current != null && current.item != key)

{

current = current.link;

}

return current;

}

public final void Append(int newItem)

{

Node newNode = new Node(newItem);

newNode.link = header;

header = newNode;

}

public final Node Remove()

{

Node x = header;

if (header != null)

{

header = header.link;

}

return x;

}

public final Node searchPrevious(int key)

{

if (header == null)

{

return header;

}

else

{

Node current = header;

while (!(current.link == null) && (current.link.item != key))

{

current = current.link;

}

return current;

}

}

public final void Insert(int newItem, int preKey)

{

Node current;

Node newNode = new Node(newItem);

current = Search(preKey);

if (current == null)

{

System.out.println("there is no such preKey!");

}

else

{

newNode.link = current.link;

current.link = newNode;

}

}

public final void Delete(int key)

{

if (header == null) // The list is empty!

{

System.out.println("The list is empty!");

}

else

{

if (header.item == key) // The only node in the list is to be deleted.

{

header = header.link;

}

else // The list has more than one node.

{

Node p = searchPrevious(key);

if (p.link == null)

{

System.out.println("There is no such item!");

}

else

{

p.link = p.link.link;

}

}

}

}

public final void ShowLinkedList()

{

if (header == null)

System.out.println("The list is empty!");

else

{

Node current = header;

System.out.printf("%1$s->", current.item);

while (!(current.link == null))

{

current = current.link;

System.out.printf("%1$s->", current.item);

}

System.out.printf("null");

System.out.println();

}

}

public final void PrintList()

{

if (header == null)

{

System.out.println("The list is empty!");

}

else

{

Node current = header;

System.out.println(current.item);

while (!(current.link == null))

{

current = current.link;

System.out.println(current.item);

}

}

}

}

(Programming) Use p2-1 linkedListClass as a reference, add the following operations in the class LinkedList Find the average data values of the linked list. Find the item with largest key, and then delete the node. Test ALL operations in the Main method. (Also display the average of the data values of the linked list, the largest key, the linked list before and after deleting the node with the largest key 6. 7. (Programming) Modify p2-1 SingleLinedList programs so that it handles employee objects. Make your program menu-driven. The class employee is the same as in Assignment 2: laport Java.util.scaner pubiic class esployee public int Ld public String nane public double salary public vold Input O Systen.out.printin( "Enter nane:) nane- new Scanner(Systos.in) nextLine Systes.out.printin("Enter 0 d-Integer parsetat (new sanner (Systes.In) nextin) Systee.out.printinf Enter Salary alary Double.parseboublenow Scanner(Syston.1n).nextl)) public vold Output Systen.out.printane: iSs, 10: 25, Grade: ass"nane, 10, salary) blic String tostring