(8 marks) Consider the following algorithm. Algorithm A Input: a positive integer n s - 0 for i from 1 ton for j from 1 to n for k from i+j to 2n s+ s + i*j*k returns Following a process similar to what we did in class for selection sort, analyze the running time of this algorithm, using 0, N and O. Provide clear explanations for your upper bound and lower bound. [If it helps to simplify your analysis a little bit, you can assume for this question that n is even.)