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. So here is the char[][] MappInput 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.

In excel - calculate the actual increase/decrease from first quarter to the second quarter then subtract subtract first quarter value from second quarter total then divide result by first quarter value

Select the correct answer. what does it indicate when a website displays https instead of http? a. the website is secure. b. there is no secure sockets layer. c. the secure sockets layer is hidden. d. the website is not secure.

Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.