Daniel Liang 11 the edition Java 8.7 (Points nearest to each other) Listing 8.3 gives a program that finds two points in a two-dimensional space nearest to each other. Revise the program so that it finds two points in a three-dimensional space nearest to each other. Use a two-dimensional array to represent the points. Test the program using the following points: double[][] points = {{-1, 0, 3}, {-1, -1, -1}, {4, 1, 1}, {2, 0.5, 9}, {3.5, 2, -1}, {3, 1.5, 3}, {-1.5, 4, 2}, {5.5, 4, -0.5}}; of using  double[][] inputArray() int[] closestPoints(double[][]) which returns an array containing the two line numbers of the closest points void displayClosestPoints(int, int)

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