Consider a divide-and-conquer algorithm, which solves a problem of size $n$ by dividing it into two subproblems of size $n/3$ and $n/5$, respectively. The solutions of the subproblems are then combined in $\Theta(n^2)$ time. Which of the following is correct about the time complexity $T(n)$ of this algorithm?