Mam to jako zadanie domowe i muszę to zrobić w Pythonie.

<code>Problem:
The Maximum Route is defined as the maximum total by traversing from the tip of the triangle to its base. Here the maximum route is (3+7+4+9) 23.

3
7 4
2 4 6
8 5 9 3

Now, given a certain triangle, my task is to find the Maximum Route for it. 
</code>

Nie wiem, jak to zrobić ....