in c++ also explain the working of each line of this code
Write a function named "eliminate_duplicates" that takes an array of integers in random order and eliminates all the duplicate integers in the array (Store the data shown below). The function should eliminate duplicates and insert -1 in its place.
The function should take two arguments:
(1) an array of integers;
(2) an integer N that tells the number of elements in the array.
The function should not return a value, but if any duplicate integers are eliminated, then the function should change the value of the argument N that was passed to it so that the new value tells the number of distinct integers in the array.
Here is an example. Suppose the array passed to the function is as shown below, and the integer passed as an argument to the function is 11.
0 | 1 | 2 | 3 | 4 |5 | 6 | 7 | 8 | 9 | 10|(index)
58 | 26 | 91 | 26 | 70 | 70 | 91 | 58 | 58 | 58 | 66 (values)
Then the function should alter the array so that it looks like this:
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10|
58 | 26 | 91 | -1 | 70 | -1 | -1 | -1 | -1 | -1 | 66
and it should change the value of the argument so that it is 5 instead of 11 .