For Problem 3 you can use 1 or 2 extra arrays of at most n elements each, or 1 array with at most 2*n elements, and a few extra variables.

Use comments to explain well your algorithms to solve the given problem and an estimate of how many operations (such as comparisons, swaps, additions etc.) your algorithm performs

MAGIC SQUARE A magic square is a square array of numbers 4 9 2 consisting of the distinct positive integers 1, n2 arranged such that the sum of the n 3 5 7 numbers in any horizontal, vertical, or main 8 1 6 diagonal line is always the same number known as the magic constant 1 n On: 1 16 3 13 So for n-3 the magic constant is 15, while 5 10 11 8 for n 4 it has the value 34. 9 6 7 12 Given a square array, write a program to check if the array is a Magic Square. 4 15 14 1