Coin Collecting Problen ( Dynamic Programming )

please i need an example with trace for each step

F[1, 1]C[1, 1]; for j 2 to m do F[1, j]F[1, j 1]+ C[1, j]

for i 2 to n do

[i, 1]F[i 1, 1]+ C[i, 1]

for j 2 to m do

F[i, j ]max(F [i 1, j], F[i, j 1]) + C[i, j ]

return F[n, m]