What divide and conquer algorithm could i use step by step to solve this problem? Also, what is the running time? I don't need code i just would like the algorithm.

Problem 3 (Magic Square). (20 points) A magic-square is a nx n array where every number from 1 to n2 appears once in the array. The sum of numbers in every row, column and diagonal of the array is the same. See below for a 3 x 3 magic-square: 8 1 6 3 5 7 4. 9 2 Suppose n= :3k for some integer k > 1, design an algorithm that outputs a n x n magic square. Analyze the running time of your algorithm. (There are many ways to solve this problem, but please try to use divide-and-conquer.)