please include the documanttion and the main method as below question

database is to be developed to keep track of student information at your college. It will include names, identification numbers, and grade point averages. The data set will be accessed in the key field mode, with the student's name being the key field. Code a class named StudentListings that defines the nodes. Your class should include all the methods in the class shown in Figure 2.28 except for the setAddress() method. It should also include a no-parameter constructor. Test it with a progressively developed driver program that verifies the functionality of all of its methods.

figure 2.28 as below

public class Node

{

private String name; //key field

private String address;

private String number;

public Node(String n, String a, String num)

{

name=n;

address =a;

number= num;

}

public String toString()

{

return("Name is" + name +

" Address is" + address +

" Number is" + number + " ");

}

public Node deepCopy()

{

Node clone = new Node(name, address,number);

return clone;

}

public int compareTo(String targetKey)

{

return(name.compareTo(targetKey));

}

public void setAddress(String a) // coded to demonstrate

//encapsulation

{

address = a;

}

public void input()

{

name = JOprtionPane.shoInputDialog("Enter a name");

address = JOptionPane.showInputDialog("Enter an address");

number = JOptionPane.showInputDialog("Enter a number");

} // end of inputNode method

this question is realted to another two question as below

Code an application program that keeps track of student information at your college: names, identification numbers, and grade point averages in a fully e ncapsulated (homogeneous) Sorted array-based data structure. When launched, the user will be asked to input the maximum size of the data set, the initial number of students, and the initial data set. Once this is complete, the user will be presented with the following menu:

Enter: 1 to insert a new student's information,

2 to fetch and output a student's information,

3 to delete a student's information,

4 to update a student's information,

5 to output all the student information in sorted order, and

6 to exit the program.

The program should perform an unlimited number of operations until the user enters a 6 to exit the program.

NOTE! To complete this excercise we need to read these two excercises:

19. A database is to be developed to keep track of student information at your college. It will include names, identification numbers, and grade point averages. The data set will be accessed in the key field mode, with the student's name being the key field. Code a class named StudentListings that defines the nodes. Your class should include all the methods in the class shown in Figure 2.28 except for the setAddress() method. It should also include a no-parameter constructor. Test it with a progressively developed driver program that verifies the functionality of all of its methods.

20. Code a class that implements the Sorted Array structure, and write a progressively developed driver program that verifies the functionality of all of its methods. Assume that it is to store a data set whose nodes are described in Exercise 19. Include error checking in the code of thebasic operation methods, a constructor to permit the client to specify the maximum size of the data set, and a method to display the contents of entire data set in sorted order.

//end of class Node

the main method is ipmotrant ohterwise it wont exucated