For each of the below code snippets, identify the asymptotic runtime in terms of n (i.e. the Big-Oh runtime of the function). Justify your answer briefly: (1) for (i=1;i1){ n=n/3 \} (4) i=1; while (n>1){ i=i2; n; \} while (i>1){ i--; \}<>