6. (8 points. Consider the following code fragment. NOTE: The method ODD(n) returns true if n is odd, false otherwise. while (n > 1) if (ODD(n)) n = 3 * n else n = n/2; + 1; (a) Give the best lower bound that you can for the code fragment, as a function of n. Explain how you derived your answer. Solution: Type your solution here. (b) Outline how you would go about designing an experiment to test your answer in part (a). Be sure to include what data you would collect and what you would look for in the data to support or refute your analysis. 6. (8 points. Consider the following code fragment. NOTE: The method ODD(n) returns true if n is odd, false otherwise. while (n > 1) if (ODD(n)) n = 3 * n else n = n/2; + 1; (a) Give the best lower bound that you can for the code fragment, as a function of n. Explain how you derived your answer. Solution: Type your solution here. (b) Outline how you would go about designing an experiment to test your answer in part (a). Be sure to include what data you would collect and what you would look for in the data to support or refute your analysis