For input vector x, write a function to check whether there exists at most 5 elements in x whose values are less than 7.

Given a target value t and an integer array a with nelements, write a function to sequentially search through a to find t. Your function should return the index of the target value if it is found in a, or return –1 if there is no target found.   int search(int a[], int t, int n){}

For input vector x, write a function to check whether there exists exactly 4 elements in x which are divisible by 3.

Define a function CheckSum() that takes one integer vector parameter and one integer parameter. The function computes the sum of the vector's elements. Then, the function returns true if the sum is not equal to the integer parameter, and returns false otherwise. Ex: If the input is: 4 -69 40 4 then the vector has 4 elements (-6, 9, 4, 0), and the integer parameter is 4. The output is: True, the sum of all the elements is not equal to 4. 1 #include 2 #include 3 using namespace std; 4 5* Your code goes here */ 6 7 int main() { 8 9 10 11 12 13 14 15 16 17 vector inVector; int size; int input; int i; int x; bool result; // Read the vector's size, and then the vector's elements cin >> size; for (i = 0; i < size; ++i) {