Need help to finish this C++ Assignment ( shortest path Recursive way )

Below is the Question, Template and the output of shortest path (recursive way)

Assignment:

Template: Please Use this template to modify the code:

Output: Output should look something like this

Shortest Path Problem Refer to the statement of the Shortest Path Problem in the "Handouts" section 1. Modify the code in the handout to include memoization. Modify it additionally so that it prints the actual shortest path as well as its cost. The path should be output as the sequence of rows to choose, going from left to right on the oniginal cost array. 2. Many dynamic programming problems may be solved quite simply from the "bottom up. Write a program to solve the shortest path problem using a bottom up approach. The path should be output as the sequence of rows to choose, going from left to right on the original cost array