Write a function `pickyMyMap` that accepts an array and a callback as arguments. The function should call the callback for each element of the array, passing in the element and return a new array of the results of each call to the callback function. If the result of the callback function returns something falsey, then do not add it in the result array. You may not mutate the original array.   const nums = [1, 2, 3, 4]; pickyMyMap(nums, (num) => num - 2); // [-1, 1, 2] const booleans = [true, false, true, false, true]; pickyMyMap(booleans, (boolean) => !boolean); // [true, true] You may not use Array's `map()`, `filter()`, or `forEach()` methods.

Write the function divideArray() in script.js that has a single numbers parameter containing an array of integers. The function should divide numbers into two arrays, evenNums for even numbers and oddNums for odd numbers. Then the function should sort the two arrays and output the array values to the console. Ex: The function call: let nums = [4, 2, 9, 1, 8]; divideArray(nums); produces the console output: Even numbers: 2 4 8 Odd numbers: 1 9 The program should output "None" if no even numbers exist or no odd numbers exist. Ex: The function call: let nums = [4, 2, 8]; divideArray(nums); produces the console output: Even numbers: 2 4 8 Odd numbers: None Hints: Use the push() method to add numbers to the evenNums and oddNums arrays. Supply the array sort() method a comparison function for sorting numbers correctly. To test your code in your web browser, call divideArray() from the JavaScript console.

What transpires when a parameter for an array is sent in with either the ref or out keyword, and the results are observed?

Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 3 int lastof(const int a[), int alen, const int b[], int blen) 4 { int res = 0; for (int i = 0; i =0 ; j--) if (b[j] == a[i]) { if(res[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b1->[7, 5, 9] last0f(al, 14, b1, 3): -1 Expected: 12 al->[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b2->[7, 7] lastof (al, 14, b2, 2): -1 Expected: 12 a2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b2->[7, 7] lastof (a2, 11, b2, 2): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b1->[7, 5, 9] last0f (a2, 11, b1, 3): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 10, 11, 13, 14] b3->[11, 2, 1, 15] lastof (a2, 11, b3, 4): -1 Expected: 8 Score 2/5

C++ Write a function named “checkInvalidHours” that accepts an array of PaySubobjects and its size. It will go through the array and check for invalid hours(negative values). If it is negative, it will reset the hourly payrate to 0. It willreturn how many PayStub objects that it has reset the payrate to 0.Please show you would call and test this function.

Use pointers to write a function that finds the larg- est element in an array of integers. Use {6, 7, 9, 10, 15, 3, 99, -21} to test the function.

Question 1. Write a console application with several functions that deal with a two-dimensional array of positive integers: The number of rows and number of columns of the array should be 20. Fill the array with random numbers between 1 and 1000. Search for the prime numbers in the array using the following function in your code: bool isPrime(int n) for (int i = 2; i

Write a function that accepts (but does not read) a 2D array of marks and length (the number of students).  The function returns a one-dimensional array with the total marks of the students and the class average. Write the declarations, and show the call to the function from function main.  Assume all input and output take place in function main, not in this function, and you do not have to write the code to read in the data.  Show the main program and the function call.   const int NUM_STUDENTS = 35; const int NUM_ASG = 5; //Purpose: To calculate the total marks for 35 students and the class average //PreCondition: marks is a 2D array already filled with 5 marks for each student //                             length is the actual number of students with marks //Post Condition: total is a 1D array which is the total of the 5 marks for each student avg is the class average of the total array (for length number of students) void TotalAverage(const double marks[][NUM_ASG], int length,…

4. Arrays. In order to test the functions in this question, you will need an array. We can create a three- dimensional test array as follows: testArray xijk - máx rij,k i=1 i=1 i=1 (b) Now suppose we want a function testFn2 which returns the d2 x d3 matrix {zj.k} where di Zj,k = Σ i=1

Write a function that accepts (but does not read) a 2D array of marks and length (the number of students).  The function returns a one-dimensional array with the total marks of the students and the class average. Write the declarations, and show the call to the function from function main.  Assume all input and output take place in function main, not in this function, and you do not have to write the code to read in the data.  Show the main program and the function call.   const int NUM_STUDENTS = 35; const int NUM_ASG = 5; //Purpose: To calculate the total marks for 35 students and the class average //PreCondition: marks is a 2D array already filled with 5 marks for each student //                             length is the actual number of students with marks //Post Condition: total is a 1D array which is the total of the 5 marks for each student avg is the class average of the total array (for length number of students) void TotalAverage(const double marks[][NUM_ASG], int length,…