The function below has the recursive relation T(x,y) = 2T(y/2)+O(1) when x,y>0Knowing these information, find the following: 1) The worst-case time complexity of the function2) The worst-case...

The function below has the recursive relation T(x,y) = 2T(y/2)+O(1) when x,y>0
Knowing these information, find the following:

1) The worst-case time complexity of the function
2) The worst-case auxiliary space complexity of the function
3) Explanation as to how the time complexity of the function can be improved without using multiplication operations.

Extracted text: 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