Solve the following recurrences for their closed f

Solve the following recurrences for their closed forms. Express your final answer as a tight asymptotic bound (i.e., give your answer as Theta(f(n))). You can solve these however you like, but it should be clear from your explanation how you obtained your answer. If you use the tree-expansion method, simply describe the structure of the tree in words – there is no need to include any kind of figure. You do not need to give the formal inductive proofs shown in class. T(n) = 2T(Squareroot n) + Theta(1) T(n) = T(n/2) + Theta(Squareroot n)Show transcribed image text