A magic square is an n * n two dimensional matrix of integers 1 to n² such that the sum of every row, column and diagonal is the same, i.e, for the case where n=5, the common sum is 65. The simple rule for generating a magic square when n is odd is:

Start with 1 in the middle of the top row; then go up and left, assigning the numbers in increasing order to empty squares; if you fall of the square, imagine the square as tiling the plane and continue; if a square is occupied, move down instead and continue.

a. l have to write a Java program which has a function/method called Magic(int n) that I don't understand how to create and display an n * n magic square for the case when n is odd. I'm not sure how to go about this, can I get a sample code with comments on how to create this

b. Then I have to write a brief analysis for the computing time (function of the upper bound) for the function Magic() I'm not understanding how to write this or what the computing time is.