Write a decrease-conquer algorithm to solve the following problem.

Input: an integer array

Output: the sum of squares of all elements

Ex: if the array consists of the following elements: 5, 4, 3, 1, 9 , the output is5^2 +4^2 +3^2 +1^2 +9^2 =132

What is the asymptotic running time of your algorithm based on counting the number of additions?

What is the asymptotic running time of your algorithm based on counting the number of additions? Show your work.