consider a map that is discretized into n by n squares. each square has a number that represents the altitude. this map is represented by a 2d array a. specifically, a[i, j] contains the altitude of the square (i, j). suppose one can only go from a square to an adjacent square with a lower altitude. design an algorithm and state the running time (in terms of n) that outputs whether it is possible to go from the top left square to the bottom right square. the algorithm should be as efficient as possible.
