Please help answer this queston:

In the country of Weirdonia, there is a subway system that helps one travel from station 1 to station $$n$$, numbered sequentially. Before starting your journey, you are given for each $$1 \leq i < j \leq n$$, the fare $f_{i,j}$ to travel from station $$i$$ to station $$j$$ (note that all travel is only in one direction). These fares are arbitrary and there is no logic to them. For example, it is possible that $$f_{1,3} = 10$$ and $$f_{1,4} = 5$$. You begin at station 1 and want to go to station $$n$$. Your goal is to minimize the cost of travel. Develop an algorithm using dynamic programming technique to find the optimal cost. What is the complexity of your algorithm?