1. Give the best lower bound that you can for the following code fragment, as a function of the initial value of n. What is the best-case scenario for this code? while (n>1) if (n%2=1) n=3n+1; else n=n/2