Write a Java program called DeDuplication that the program takes an input array [50, 11, 33, 21, 40, 50, 40, 40, 21] and generate an output array [11, 21, 33, 40, 50], which removes the duplicated elements and sorts the array. Users might also give any input arrays. Test your program with different testcases. In this lab, you can just use an array counter to help you. In this way, you need to know what the maximum element in the input array is.Then write a Java program called BinarySearch for the de-duplicated array (make sure it is sorted). The program prompts the user for an integer n to search, then print if the integer is found. If the integer is found, the program also prints how many checks it takes to find the integer. Otherwise, the program can just print Fail to find the input number or something similar.

!!please be reminded that you cannot use library functions to either sort and or perform the de-duplication operation.

input = ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21]

output = ARRAY[] = [11, 21, 33, 40, 50]