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){}

Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3223 palindromeSieve([5, 55, 6655, 8787]) → [5, 55, 6655, 8787] // Single-digit numbers are automatically palindromes. palindromeSieve ([897, 89, 23, 54, 6197, 53342]) - []

Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like: int Search (floats a[ ], int n, float number); Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns –1 If the number to be searched is 9.8,the function returns 2 C++ language only.