First, solve the recurrence for T2(n) using the Master Theorem:
T2(n)=5T2(4n)+Θ(log2n) Here, a=5, b=4, and f(n)=Θ(log2n).
Compare f(n) with nlogba=nlog45≈n1.161:
Since f(n)=O(nlog45−ϵ) for ϵ>0, by Case 1 of the Master Theorem:
T2(n)=Θ(nlog45) Now substitute T2(n) into the recurrence for T1(n):
T1(n)=4T1(2n)+Θ(nlog45) Here, a=4, b=2, and f(n)=Θ(nlog45).
Calculate nlogba:
nlog24=n2 Since log45≈1.161<2, we have f(n)=O(n2−ϵ) for some ϵ>0.
By Case 1 of the Master Theorem:
T1(n)=Θ(n2) Thus, the correct option is (A).