How many sub-problems are formed by the recursive algorithm at each recursive call? Provide the answer based on the recurrence relation. t(n) = 9t(n/3).
1) 1
2) 3
3) 9
4) 0