java program please solve it with good hand write

1. (10 points) Write a program that accepts as input an array of any size then runs the deterministic quicksort algorithm to sort the given array. The pivot should be chosen to be the last element in the array, 2. (10 points) Run your Quicksort program over: Reverse-sorted array of size n = 500 Sorted array of size n = 500 Array of size n = 500 consisting of random numbers ranging from 1 to 4000 In each case, record the time in nanoseconds) that it takes to output the sorted array