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: while (n>1){ n=n/3 \}