Please do #2

Given the following algorithms below, give a f(N) such that R(N) E o(f(N)) where R(N) is the running time for input of size N. For each problem, please provide i.summation ii.explanation of how the code relates to the summation ii your f(N) 2. R(N) is the running time of superGreat(N) static void superGreat (int n) for (int i-e; i<>