Please help for the Java code based on the instructions below. Please check the code and pass all the sample inputs and outputs. Thanks!

Below is the code from the DriverMain.java

--------------------------------------------------------

import java.util.*;

import java.util.stream.Collectors;

import java.lang.*;

import java.io.*;

//Your program will be evaluated by this main method and several test cases.

class DriverMain{

public static void main(String args[]){

Scanner input = new Scanner(System.in);

String str = input.nextLine();

input.close();

int[] arr = Arrays.stream(str.substring(0, str.length()).split("\\s"))

.map(String::trim).mapToInt(Integer::parseInt).toArray();

List list = Arrays.stream(arr).boxed().collect(Collectors.toList());

Collections.sort(list);

System.out.println(ProblemSolution.removeDuplicate(list));

}

}

Below is the code that need to be completed. PLEASE ENTER THE CODE HERE

-----------------------------------------------------

import java.util.*;

import java.util.stream.Collectors;

import java.lang.*;

import java.io.*;

class ProblemSolution{

public static int removeDuplicate(List list){

// PLEASE ENTER YOUR CODE HERE

}

}

Write an algorithm that takes a sorted list of n integers and remove the duplicate elements from the list and return the new length. The algorithm must run in O(n) time and O(1) space. We assume that: .List elements are inetger Input list is already sorted Sample example: INPUT 1122334455567 67 OUTPUT