ΡΥTHON Big-o CODING/SOLVING Consider the function below written in Python3: def bar(x, y): if y > 0: if (y % 2): return bar(x, y >> 1) + bar(x, y >> 1) + x return bar(x, y >> 1) + bar(x, y >> 1) else:...

Python

Big-O Notation

Pls answer only if u know Big-O

Hint and clues are also given below:

Extracted text: ΡΥTHON Big-o CODING/SOLVING Consider the function below written in Python3: def bar(x, y): if y > 0: 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 Fill-in the boxes with the correct answer. The recurrence relation for bar(x, y) when x, y > 0 is: T(æ, y) = 2 +0(1 T ( HINT/CLUE: T (n/2) and T(x, y/2) is NOT the answer. What is the worst-case auxiliary space complexity of bar(x, y)? Answer: