ALGORITHMS DYNAMIC PROGRAMMING QUESTION

Calculate the number of paths from node 1 to node 14. (Hint: assume a path must have at least one edge in it to be well defined, and use dynamic programming to fill in a table that counts number of paths from each node j to 14, starting from 14 down to 1.

I am trying to understand this material really well for my algorithms class. Can you please show your work steps and explain how you got the answer along with the answer.

Also, if you hand write the answer if you could please write it neatly that would be awesome! I have a lot of trouble reading script and whatnot.

TO CLARIFY: I do not need code or anything, just the table and the steps to filling the table and an explanation.

2 3 4 5 6 7 8 10 12 13 14 2 3 4 5 6 7 8 10 12 13 14