Given the code below: 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 Find: 1. The recurrence relation when xy>0, (The answer should be of the form T(x,y) = T() + O(), fill the blanks) 2. worst-case time complexity 3. worst-case auxiliary space complexity 4. Explain how can the time complexity be improved without using multiplication operations. Plain text