Write a code in C++ / cpp to solve the following problem Sasha has an array that contains each number between 1\dots n1…n exactly once. Sasha wants to pick these numbers from 11 to nn in increasing order. On each step, she goes through the array from left to right and picks as many numbers as possible. What will be the total number of steps? Input The first input line has an integer n: the array size. The second line has n integers x1​,x2​,…,xn​: the numbers in the array. Constraints: 1 <= n <= 2*10^5 Output Print one integer: the number of steps. Sample 1 Input 5 4 2 1 5 3 Output 3

write in jva

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