Some solutions that are done in Java (Greedy Alg)

The problem description for both says to use top to bottom analysis,
however, the correct answer is only achieved using dynamic programming
from bottom to top. That said, I have included the answer to the problem
asked, not the exact solution. At a later time, I will make the solution
to be consistent with dynamic programming, or someone else can. It's the
exact same concept, but starting at the bottom row, and working upward,
yielding the biggest number on the bottom guaranteed.