Consider the following bit of pseudo-code // Input: non-negative integer n // Output: well, that's what you are going to figure out! what Does ItDo ( n ) { } S = 0 for i = 1 to n { } S sii return s a) What does the algorithm compute? b) What is the basic, or most frequently used operation? c) How many times is this basic operation executed? d) What is the time complexity class of this algorithm? e) Try to suggest a more efficient algorithm and give its efficiency class. If you can't think of an improvement, try to prove that there is no possible improvement.