in java please

* deDupAndReverse returns a new array containing the unique values in the *original array reversed. There should not be any extra space in the arraythere should * be exactly one space for each unique element (Hint: numUnique tells you * how big the array should be). You may assume that the List is sorted, as *you did for numUnique Your solution may call numUnique, but should not call any other *functions. After the call to numUnique, you must go through the array * exactly one more time. Here are some examples (using " informally): *Precondition: the array may be empty, but if it is not empty the array is sorted from low to high your solution can assume this is true pre * new int[] { } -= deDupAndReverse(new int[] { }) * new int [ ] { 11 } = deDupAndReverse (new int [ ] { 11 }) * new int[] { 11 } == deDupAndReverse (new int[] { 11, 11, 11, 11 }) new intl] 88, 77, 66, 55, 44, 33, 22, 11deDupAndReverse(new int[] f 11, 11, 11, 11, 22, 33, , ne: ine084, 55, 85, 85, 14, 3, 22, 12 ) debupndReverse(new int[] 11, 22, 33, 44, 44, 44, public static int] deDupAndReverse (int] list) return list; // TODO2: fix this