Problem 2 Function Analysis (33 points) Assume n is a power of 3. Assume we are given an algorithmic routine f(n) as follows: function f(n): if n > 1: for i in range(n): for j in range(n): print("dividing") f(n/3) f(n/3) f(n/3) else: print("conquered") Part A (10 points) What is the running time T(n) for this function f(n)? You don't need to justify your answer. Part B (15 points) How many "dividing's will this function print? How many Conquered s will this function print? Please provide the exact number in terms of the input n. What is their relation to running time (n)? You need to justify your