You are an avid rock collector who lives in southern California. Some rare and desirable rocks just became available in New York, so you are planning a cross-country road trip. There are several other rare rocks that you could pick up along the way. You have been given a grid filled with numbers, representing the number of rare rocks available in various cities across the country. Your objective is to find the optimal path from So_Cal to New_York that would allow you to accumulate the most rocks along the way.\n\nNote: You can only travel either north (up) or east (right).\nb) Consider adding some additional tests in doTestsPass().\nc) Implement optimalPath() correctly.\nd) Here is an example:\n^\n{{0, 0, 0, 0, 5}, New_York (finish) N\n{0, 1, 1, 1, 0},\nSo_Cal (start) {2, 0, 0, 0, 0}} S\nv\nThe total for this example would be 10 (2+0+1+1+1+0+5).\n\n\nCan anybody give python solution/ approach for this problem?

You are an avid rock collector who lives in southern California. Some rare and desirable rocks just became available in New York, so you are planning a cross-co