We aim to select courses from a pool of $n$ courses. Since this is still in the planning phase, each course has no specified start or finish times. Each course $i$ is characterized by its duration $p_i$ and weight $w_i$. The total available classroom time is $C$. We want to identify a subset of courses $S \subseteq \{1, \ldots, n\}$ such that the total duration of courses in $S$ does not exceed $C$ and the total weight of $S$ is maximized. To achieve this, we have developed a dynamic programming algorithm that uses a $(n+1) \times (C+1)$ table $T[0:n, 0:C]$ to solve the problem. Here, $T[i,j]$ represents the maximum total weight achievable when considering only the subset of courses $\{1, \ldots, i\}$ and a classroom available for $j$ units of time. Write the recursive formula to compute $T[i,j]$.