Need a program in which Cookie Monster finds the optimal path from… Need a program in which Cookie Monster finds the optimal path from the upper left corner (0, 0) to the lower right corner (SIZE-1, SIZE-1) in a cookie grid (a 2-D array). Each element of the grid contains either some number of cookies (a non-negative number) or a barrel (-1). On each step Cookie Monster can only go down or to the right. He is not allowed to step on barrels. The optimal path contains the largest number of cookies.The program reads the cookie grid from a file and reports the number of cookies on the optimal path. (The path itself is not reported.) A sample data file is provided in JMCh19Exercisescookies.dat.Hints: Use a stack. If there is only one way to proceed from the current position, then go there and update the total accumulated number of cookies. If there are two ways to proceed, save one of the possible two points (and its total) on the stack and proceed to the other point. If you have reached the lower right corner, update the maximum. If there is nowhere to go, examine the stack: pop a saved point, if any, and resume from there. Computer Science Engineering & Technology Java Programming CS MISC
