Introduction to Design Analysis and Algorith Ch 3.4 problem 10 Please show step by step solution

Magic squares A magic square of order n is an arrangement of the integers from 1 to n2 in an n n matrix, with each number occurring exactly once, so that each row, each column, and each main diagonal has the same sum. a. Prove that if a magic square of order n exists, the sum in question must be equal to n(n2 + 1)/2. b. Design an exhaustive-search algorithm for generating all magic squares of order n.