Please use dynamic programming algorithms to complete this question: DYNAMIC PROOGRAMMING DYNAMIC DYNAMIC, NOT GREEDY APPROCH!

Imagine you're a tourist on Manhattan, and that's a map. You start at upper left corner (with coordinates 0,0) and should end up at the bottom right corner (with coordinates 4,4). Weights on edges indicate how many attractions you will see if you walk on that street/avenue. Your goal is to see as many attractions as possible. Fill in the matrices A (values, max numbers of attractions one can see up to that "road intersection") and B (arrows, so one can reconstruct the path). b) Using Dynamic programming - 0 1 2 3 4 D