[Using Java]

In this exercise, you will first create a Student class. A Student has two attributes: name (String) and gradePointAverage (double). The class has a constructor that sets the name and grade point average of the Student. It has appropriate get and set methods. As well, there is a toString method that prints the student's name and their grade point average (highest is 4.0) You will then write a demo program. In the demo program, you will create an ArrayList of Students. You will populate the arraylist with user inputted data. You should store the students alphabetically by name (A to Z) in the arravlist The algorithm to sort is simple. As you read in each name for the Student (say name1), compare it with each name (say name2 of a Student) stored in the arraylist starting from the index 0. As soon (namel.compareTo(name2) >0), that is the right index to put name1. Be sure that you do not cross the arraylist boundary In addition, you will write a method in your demo class that will take in your arraylist of students and return a new arraylist with the students sorted by their grade point average (highest to lowest). You can apply the same sort algorithm that you used for the names See below for a sample output Enter student name or quit: Bush, Sue Enter grade point ave: 3.4 Enter student name or quit: Neddle, Ned Enter grade point ave: 3.2 Enter student name or quit: Zhang, Bin Enter grade point ave: 3.7 Enter student name or quit: Adda, Ida Enter grade point ave: 3.9 Enter student name or quit: quit Students: [ Adda, Ida Grade Point Ave: 3.9, Bush, Sue Grade Point Ave: 3.4, Neddle, Ned Grade Point Ave: 3.2, Zhang, Bin Grade Point Ave: 3.7] Students in order of Grade Point Average [ Adda, Ida Grade Point Ave: 3.9, Zhang, Bin Grade Point Ave: 3.7, Bush, Sue Grade Point Ave: 3.4, Neddle, Ned Grade Point Ave: 3.2]