PLEASE BE REMINDED TO USE THE NOTE WHEN ANSWERING, AS THE ANSWERS SHOULD BE IN MATH SYNTAX. THANK YOU!

Please answer it without copying responses from prior questions because it is different. Thank you very much

Note that when complexities or expressions are asked: Answer without the big-O. Assume a, x, and y are very large. Use 'logo' to add the logarithmic function (e.g. n log(n) is written as n* log(n)). Use"(e)' to create exponents (e.g. 2" is written as 2^(n)). Use 'sqrt()' to create square roots (e.g. n is written as sqrt(n)). Remember that logo a = log a/ log b. Consider the function below written in Python3: def bar(x, y): if y> : if (y % 2): return bar(x, y >> 1) + bar(x, y >> 1) + x return bar(x, y >> 1) + bar(x, y >> 1) else: return 0 The recurrence relation for bar(x, y) when x, y > 0 is: T, T(x, y) = OTO +od What is the worst-case time complexity of bar(x, y)? (Follow/use the notes above) Answer: Display response What is the worst-case auxiliary space complexity of bar(x, y)? (Follow/use the same notes above) Answer: Display response