List of practice Questions

Which of the following can be recurrence relation(s) corresponding to an algorithm
with time complexity Θ(𝑛)?

Consider the following recurrence relations:
For all \(n > 1\),
\[T_1(n)=4T_1\!\left(\frac{n}{2}\right)+T_2(n)\]
\[T_2(n)=5T_2\!\left(\frac{n}{4}\right)+\Theta(\log_2 n)\]
Assume that for all \(n\leq 1\), \(T_1(n)=1\) and \(T_2(n)=1\).
Which one of the following options is correct?