Problem 1: [10 points]
Write a function called removeDuplicates that removes all duplicates from a sorted Vector of integers. Use the following function header:
void removeDuplicates (Vector & list)
For example, if list contains 12 integers and these are (in order):
10 10 123 123 123 145 167 198 198 198 198 294
Then the function removeDuplicates should modify list to contain (in order):
10 123 145 167 198 294
The function removeDuplicates should resize list after it has completed removing the duplicates.
Problem 2: [10 points]
Problem 8.8 from Section 8.7 (page 415). Instead of a Vector of bool values, use a Vector of int values (with 1 representing true and 0 representing false). This problem describes an algorithm called the Sieve of Eratosthenes algorithm for determining prime numbers. The problem asks you to write a program to implement this algorithm. The program you write should prompt the user for N and produce as output all primes in the range 2 through N.