5 [007] (25%) [Analysis of non-recursive algorithm] Cons questions below. algorithm) Consider the following algorithm. Answer Algorithm Mystery(n) // Input: A nonnegative integer "n" Sto for i = 1 to n do SES+ (i*i*i) return S a) [3%] What does this algorithm do? b) [2%] Find the basic operation multiplication c) 110% How many times is the basic operation executed? Show your work. A d) (10%) What is the efficiency class of this algorithm? ety times [25%) [Analysis of recursive algorithm] Consider the following below. cursive algorithm] Consider the following algorithm. Answer questions Algorithm S(n) if n = 1 return 1 else return S(n-1) + (n*n*n) inltiplication a) [3%] What does this algorithm do? b) [2%] Find the basic operation. Multiplica c) [5% Set up a recurrence relation for en is executed. d) (10%) Solve the recurrence relations e) [5%] What is the efficiency class of this al stion for his number of times the algorithm's basic operation of this algorithm? O "backward substitution." Show your work. On pepe n