What is the algorithim in c++ to get and display every isntance of a magic square for some odd int "n". A magic square is a matrix nXn where the rows, columns, and diagnoals add up to n(n^2+1)/2. E.g one magic square of 3 is 816 357 492 and another one is 294 753 618. How write a program that gets every solution to the magic square problem.