Compute the complexity and show steps for the solution:

Compute the asymptotic complexity of an algorithm with runtime T(n, n) where T(x, c) = theta (x) for c lessthanoreualto 2, T(x, y) = theta (x) + S(x, y/2), S(c, y) = theta (y) for c lessthanoreualto 2, and S(x, y) = theta (y) + T(x/2, y)