1. Write a function to search a value in an array of integers. If the integer i

1. Write a function to search a value in an array of integers. If the integer is found in the array, return true, else return false. The function prototype is as follows: Use linear search algorithm to solve this problem. (10 points) bool searchValue(int[], int, int); (**the three parameters are array, size of the array, value to be searched) 2. Declare a pointer variable bitArray which points to a newly allocated array of 50 boolean values. (4 points) 3. Declare a function prototype for a function calcSum, which has two parameters, one is of type pointer to an array of double, and the other is the size of the array. The function does return a pointer which points to the sum. (sum is a type of double). (4 points) 4. Declare a struct named Product. Product struct has 3 members as follows: (4 points) productID – integer name – string description – string 5. Declare an array of Productstruct (created on Q4) and name it productList which contains 2 software products. (4 points)