Question

Exercise 1: Finding the maximum value (10 points) Provide an implementation of the maximum function whose declaration is shown below. The only argument of the function is a vector vof int. The function returns the largest int that is in the vectorv int maximum(const vector<int & v) Exercise 2: Appending vectors (10 points) Provide an implementation of the appendVector function whose declaration is shown below. Both arguments of the function are vectors of int. The function should modify vector vby appending to it all the elements of w. For example, if v= (4, 2, 5) and w= (11, 3), then v will become (4, 2, 5, 11, 3) as a result of calling the function. Hint: the vector class has a function called push_back that appends values passed into it. void appendVectorívector<int> & v, const vector<int> & w) Exercise 4: Prime factors (10 points) Implement a function that takes an integer as its sole argument and returns a vector containing the prime factors of that number. For example, if you pass in 100, then function returns the vector (2 2 5, 5. The function signature should look like the following. vector<int> factor(int n) Exercise 5: Vector insertion (10 points) Suppose a vector vcontains a sequence of integers ordered from lowest to highest. For example, vmight contain the values 3, 6, 7, 12. Write a function called insert that takes this vector vas a first argument and an integer kas the second argument. The function inserts kinto the vector so that it preserves the order of elements. For example, if vwere (3, 6, 7, 12) and kwere 5, then after calling the function, vwould be (3, 5, 6, 7, 12). In your implementation of insert, do not use the insert function of the vector class (v.insert).

Example program

#include <string>
#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

vector<int> factor(int n)
{
    vector <int> v1;
    // Print the number of 2s that divide n
    while (n%2 == 0)
    {
        printf("%d ", 2);
        n = n/2;
        v1.push_back(2);
    }

    // n must be odd at this point. So we can skip
    // one element (Note i = i +2)
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            cout << i << " ";
            //push something
            n = n/i;
        }
    }

    // This condition is to handle the case when n
    // is a prime number greater than 2
    if (n > 2)
        cout << n << " ";
        //push something
    
    return v;
   
}

int maximum(const vector<int> & v)
{
int max = v[0];
for (int j= 0; j<v.size() ; j++)
{
    if (v[j]<max) max = v[j];  
}
return max;
}

int main()
{
int num;
vector <int> v1 = {1,2,3};
int max = maximum(v1);
cout << "Max is: " << max;
cout << "Please enter a number: "<<endl;
cin >>num;
// call the function for prime factors



}