Part1 code must be in jave

2 Construct the priority queue for student data as followings, where a student data contains name/id /GPA, and GPA is used as the key:

1. Implement the priority queue of students using (i) sorted array structure, and (ii) heap structure, respectively.
2. Compare the time complexity between two implementations for extract and insert operations. Part2 1 Implement a Black-Red Tree which support search and insertion: a class with two operations search & insertion; a main method to test the operations. 2 Add deletion to 1