Given an array of integers, define a function that takes the array as a parameter and return true if 6 appears as either the first or last element in the array. The array will be length 1 or more. checkFL6([1, 2, 6]) → true checkFL6([6, 1, 2, 3]) checkFL6 ([13, 6, 1, 2, 3]) → false → true Write the function checkFL6 and test it for the given cases.

in c

Write a C++ program to declare an array A={3, -7, 12, -4, 5, -2} and pass it to a void-type function findMaxMinAvg (array) that prints out the maximum, minimum and average values in the array. Your answer

What is the big O notation for this function?

Create a function named "onlyOdd".The function should accept a parameter named "numberArray".Use the higher order function filter() to create a new array that only containsthe odd numbers. Return the new array.// Use this array to test your function:const testingArray = [1, 2, 4, 17, 19, 20, 21];

Write a c++ function reportDuplicates() that takes a two dimensional integer array as a parameter and identifies the duplicate valuesin the array. The function then reports these to user. Sample input and corresponding output:How many rows? 5How many columns? 2Let’s populate the array:1 86 97 312 522 4Thank you, there are no duplicate elements!How many rows? 3How many columns? 4Let’s populate the array:3 7 5 76 9 7 38 5 12 6Thank you, 3 appears 2 times, 7 appears 3 times, 5 appears 2 times,and 6 appears 2 times.

///////1/////. Given an array of integers, write a PHP function to find the maximum element in the array. PHP Function Signature: phpCopy code function findMaxElement($arr) { // Your code here } Example: Input: [10, 4, 56, 32, 7] Output: 56 You can now implement the findMaxElement function to solve this problem. Let me know answer. //. .

Write a function that gets an array as a parameter (address and size) and a number and checks to see if that number exists in the array. The function should report every single occurrence of the number in the array.  It should also report how many occurrences were detected in total (use c code)Suggested prototype:    void findnReport(int* ar, int size, int num)   Example of function output:  If array = {2,5,3,5,12,13,14,15,0,5,-1,11,5} and num = 5, Number 5 found in array index 1 Number 5 found in array index 3 Number 5 found in array index 9 Number 5 found in array index 12 Total of 4 occurrences of number 5

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]) - []

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false