In java, create programe that find shortest steps to reach maximum gold (only right and down move) and print path. start from [0][0] in the top conner while avoiding steps the 'T' trap. Hint: using brute force search and dynamic programing
So here is the char[][] Mapp

Input is 2d array matrix:

char[][] MapGnomes = {
{'.', 'T', '.', '.', 'T', },
{'.', '1', '3', '.', '.', },
{'2', 'T', '.', '4', 'T', },
{'.', '.', '3', '.', '6', },
{'4', '.', '.', '.', 'T', },
{'4', 'T', '4', '3', '2', },
{'3', 'T', '.', '.', 'T', },
};

And output:

maximum gold is: 16.

Steps to reach maximum gold is: 10.

Path to reach maximum gold is: DDR.