Objective: To understand runtime complexity (algorithm efficiency). Useful mathematical summations: 1+2+3+.+(n1)+n=2n(n+1)a0+a1+a2+a3+.+a(n1)+an=a1an+1120+21+22+23+.+2(n1)+2n=212n+11 NB: DO NOT JUST WRITE THE ANSWER. You must explain in some way by (a) a diagram, (b) showing the order of each line of code in braces and finding the dominant term, (c) a graphical representation or (d) a few sentences. Failure to do so, will result in a reduced score. Run Time Complexity/Algorithm Efficiency 1. What is the order of n,O(f(n)) for the following nested loop? for(i=1;i