How do I approach to the answer

Consider the following recurrence relation. T(n) = {4 if n = 1, 6T(n/3) + n(n - 1) if n = 3^d, d > 0. Draw a table that summarizes all the relevant information obtained from the recursion tree, namely, for each level, the number of nodes, the cost of each node, and the total cost associated to the level. From (a), determine the exact value of T(n)