You are given an array of integers and an index x. Without sorting Re-arrange the array as below: elements less than array[x] followed by elements equal to array[x], followed by elements greater than array[x]  Array, a = [3,5,2,6,8,4,4,6,4,4,3] and x = 5 Write a Java Program that re-arranges the above given array exactly as shown below without using a sorting routine of any kind output array = [3,2,3,4,4,4,4,5,6,8,6]

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 //…