Write a C++ program that removes all duplicates from the vector sorted in non-decreasing order. The algorithm should be an inplace algorithm, i.e. if there are k unique elements in the array then...

Extracted text: Write a C++ program that removes all duplicates from the vector sorted in non-decreasing order. The algorithm should be an inplace algorithm, i.e. if there are k unique elements in the array then those first k unique elements should be present at the front of the vector. vector v ={1,1,2,3,3,3,4,5,6,6,7}. Expected vector: {1,2,3,4,5,6,7, no use .}