How to solve the turtle problem?

Question

Algorithms

I can’t figure out how to solve it, there are a few other examples on the Internet ...
There is a grid on which the turtle can move. You can only move along the black lines. The turtle needs to get from point A to point B. At each corner, it can only turn on T1 or only T2. The driving time for each street is indicated in the table. It is required to find the maximum time for which the turtle can get from point A to point B.
Make a calculation on paper using dynamic programming. Present the calculation process in the form of a table. For the second row from the top of the table, write out a detailed calculation.
If A is the upper left corner, B is the lower right corner. T1 - east, T2 - south.

Answer 1

dynamic programming method

That is, the subtask is the passage of the intersection and its recursive execution starting from point A.

Answer 2

I found this problem in a normal form on cyberforum'e
www.cyberforum.ru/programming-theory/thread1455071.html
And I'm ready to suggest a solution))) https://ru.wikipedia.org/wiki/%D0%9F%D0% BE%D0%B8%D...
But there's no way to decide)