g (1) consider the below integer array which is already sorted { 1, 2, 3, 4, 4, 6, 6, 6 } write a complete program in java which removes the duplicates from the array in o(n) time with o(n) space complexity owing to a hash structure. your output should be [ 1, 2, 3, 4, 6] .