Sample questions Write a function template named "remove_duplicate" to remove duplicate elements in a vector v. The function template takes one parameter: v, the vector. The elements in the vector are...

This is a request to negotiate for an expert to complete a timed test on Data Structures and Algorithms with C++. There will be 3-5 few short questions on the test. It starts on Apr 19, 10:00 AM EDT, and I will send the questions here immediately. The expert has 90 minutes to complete the test and the solution has to be delivered by 12:00 (noon) EDT. Some samle problems are attached.


Sample questions Write a function template named "remove_duplicate" to remove duplicate elements in a vector v. The function template takes one parameter: v, the vector. The elements in the vector are not sorted. The function template returns the number of elements deleted from the vector. Write your function template in the correct C++ syntax . Write a function template named "sequential_search" to determine if a vector v contains a particular value x. The function template has two parameters: vectorv, and value x to search. The elements in the vector are not sorted. The function template returns the smallest index of the vector where x is in the vector (in case duplicate elements are stored in the vector), and -1 (negative 1) if x is not found in the vector. • Write your function template in the correct C++ syntax. (10 points). . What is the time complexity of your search function template in terms of the big-O notation? Briefly explain your answer. (5 points)