Insertion Sort Algorithim in java with out duplicates

so say we have an int array with these values {9, 9 , 8, 7, 6, 5, 5 4, 3, 2, 1, 1 }

It should only print { 1 , 2 , 3, 4, 5, 6, 7, 8, 9} no duplicates using insertion sort

please explain how you came to you're answer !