What is the asymtotic runtime (ie Big-O) of the following piece of code as a function of n. Show enough work to justify your answer. public int hmm (int n) { int k=1; for (int i=1; i 0; j/=2) { k=k+j; System.out.print(k); } } return k; }