Searching: bool linear_search(const bool binary_search(const int arr[], int n, int value, int& comparisons); int arr[], int start, int end, int value, int& comparisons); The linear_search function is to perform linear search iteratively from the beginning of a sorted array. It returns true if the target value is found in the array, false otherwise. In addition, the function shall store the number of comparisons performed by the algorithm in comparisons parameter. Since the array is sorted, it is important for the search to stop searching when all elements smaller than the given value have been evaluated. The binary_search function is to perform binary search recursively. It returns true if the target value is found in the array, false otherwise. In addition, the function shall store the number of comparisons performed by the algorithm in comparisons parameter.

Write a function in C++ that accepts a single number, calculates the number of positive odd numbers below the parameter value and returns the calculated result to the main method.

please code this for me in c++ using void, functions, loops, (basic c++ not complicated or highlevel please). I tried to code it myself but there are many mistakes I dont know how to fix so please write a similar one for me but it works.  The question is only 1 but it has 2 parts (2 different functions that should be in one code)       MY CODE:  #include <iostream>using namespace std; int IsPalindrome(int p);void GCD(); int main (){    int choice;    cout << "Please enter a choice: "<<endl;     cout << "Enter one for IsPalindrome "<<endl;    cout << "Enter 2 for GCD "<<endl;    cout << "Enter 3 to exit the program "<<endl;     cout << "Choice: "<<endl;     cin >> choice;            if (choice == 1)    {        int p;        cout << "Please enter a 3 digit number: "<<endl;         cin >> p; if(p%10==p/100)      {  cout<<p<<" is a palindrome " <<endl;  }  else {…

In C++ fill in the blanks