Computer Science - Python

Question:

Using ONLY Accumulative Recursion, please solve the following (No other forms of recursions/abstract list functions are allowed):

Write a function: times_table(n)

that consumes a natural number n and returns a times table for all numbers between 0 and n inclusive. A times table T is a list of lists, of size (n+1)x(n+1), such that for any numbers x and y, each of which is between 0 and n, T[x][y] == x*y.

Samples:

times_table (0) => [ [0] ]

times_table (3) => [[0, 0, 0, 0] ,

[[0, 1, 2, 3] ,

[[0, 2, 4, 6] ,

[[0, 3, 6, 9]]