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 i. explanation of how the code relates to the summation ii your f(N) 1. R(N) is the running time of doSomething(N) statio void doSomethinglint n) t for (int = 0; 0; j- 2) { System.out.printin ("Sonething")