Please help me write this code in Java 8. Please make sure that the code meets all the needed requirements mentioned in the question under each part such as in INPUT FORMAT, OUTPUT FORMAT, AND CONSTRAINTS. Can you also make sure to comment the code? Please include screenshots of your input and output, which should match the ones in the question. Thank You!

I've tried to do this, but I keep getting the wrong output with the input given below. Please make sure that the output that you get MATCHES the output given in the question after you enter the input that is in the question.

This is the sample input and the sample output. Your code should give the exact same output as below after entering the sample input given.

Sample Input 0

8 danielle rothermel 2015 sarah shatan-pardo 2017 david shatan-pardo 2015 alisa nguyen 2015 todd hirsch 2017 lina kroehling 2015 jess geiger 2014 anita garcia 2017 

Sample Output 0

jess geiger 2014 alisa nguyen 2015 david shatan-pardo 2015 anita garcia 2017 todd hirsch 2017 lina kroehling 2015 danielle rothermel 2015 sarah shatan-pardo 2017 jess geiger 2014 alisa nguyen 2015 david shatan-pardo 2015 anita garcia 2017 sarah shatan-pardo 2017 lina kroehling 2015 danielle rothermel 2015 todd hirsch 2017 jess geiger 2014 alisa nguyen 2015 david shatan-pardo 2015 anita garcia 2017 danielle rothermel 2015 lina kroehling 2015 sarah shatan-pardo 2017 todd hirsch 2017 jess geiger 2014 alisa nguyen 2015 david shatan-pardo 2015 lina kroehling 2015 danielle rothermel 2015 anita garcia 2017 sarah shatan-pardo 2017 todd hirsch 2017 jess geiger 2014 alisa nguyen 2015 david shatan-pardo 2015 danielle rothermel 2015 lina kroehling 2015 anita garcia 2017 sarah shatan-pardo 2017 todd hirsch 2017 jess geiger 2014 alisa nguyen 2015 danielle rothermel 2015 david shatan-pardo 2015 lina kroehling 2015 anita garcia 2017 sarah shatan-pardo 2017 todd hirsch 2017

You'll be given a list of students, and you'll need to sort it using quick sort. We want to sort the students according to graduation year (soonest first), and for students with the same graduation year, alphabetically by first name (and if there are any students with the same first name and graduation year, ties should be broken by last name). However, rather than just printing the final sorted list, you'll print the partially sorted list after each call to partition. Input Format The first line of the input consists of an integer, n, indicating the number of words you'll need to sort. The next n lines will each consist of student data wtih space-separated first name, last name, and graduation year, in that order. The input will terminate with a blank line. For example: 8 danielle rothermel 2015 sarah shatan-pardo 2017 david shatan-pardo 2015 alisa nguyen 2015 todd hirsch 2017 lina kroehling 2015 jess geiger 2014 anita garcia 2017 Constraints You can assume n is a non-negative integer. You can further assume the list contains no students with the same first name, last name, and graduation year. When choosing your pivot, if the array has even size, choose the left of the two middle elements. Output Format You will be printing the partially sorted list as many times as partition is called (the last time will be entirely sorted). Each student should appear on a new line without terminating whitespace, space separated in the same format it was provided in the input, and each partially sorted list should be followed by a blank line to indicate where it ends and the next one begins. For example