Using your knowledge of C++ and arrays create three arrays of size 6, one for even numbers, one for odd numbers, and one that will contain the sum of the even and odd array locations. The arrays must be filled programmatically (i.e. no initializer lists). Then provide the total of all element of the “Sum” array. The final output should look as follows:  Evens   Odds      Sum   0             1            1   2             3            5   4             5            9   6             7          13   8             9          17 10           11          21 The total is: 66

I need to write a program named Search.java that uses a function called search_string to check whether a string exists in the array or not. 1- The array of strings is iterated using a for loop and the value at every index is compared with the value to be searched in the array. 2- A boolean variable is set if any array value matches with the string. 3- At the end of the loop, this boolean variable is checked to determine if the array contains the string. It may be necessary to import java.util.Arrays then use Arrays.toString, String equals(). Output should be as picture shows

python: numpy  def coupons(my_list, on_sale, prices):    '''    QUESTION 5    It's the time of week to go grocery shopping again!    Given three arrays, one of what's on sale, one of your own list, and one of the prices, return an array of the items on your list that are    on sale and more than five dollars. You have MORE coupons than you have groceries on your list- make sure to only use the coupons    that correspond to your list.     THIS MUST BE DONE IN ONE LINE    Hint: use masking and slicing     Args:        my_list(np.array)        on_sale(np.array)        prices(np.array)     Return:        np.array     >>> my_list = np.array(["eggs", "2% milk", "green onions", "whole wheat bread",                            "onions", "spinach", "peanut butter", "boxed spaghetti",                            "salt and vinegar chips", "alfredo sauce"])    >>> on_sale = np.array([True, False, True, True, True, True, False, False, False, True, False, True, False])…

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below.             The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std;   // Global constants const int ROWS = 3;  // The number of rows in the array const int COLS = 3;  // The number of columns in the array const int MIN = 1;  // The value of the smallest number const int MAX = 9;  // The value of the largest number //…