Write a function get_neighbors that returns a list of all neighbors for a given x and y coordinate. Neighbor must share an edge( no diagonal moves). Make sure to only return valid nodes. That is, nodes that are within the bounds of the graph and arent a wall.

right and y increases as you go down. As an example, the bold and underline 0 is at (2, o) For this assignment, you will write a function called get_neighbors(), which will return a list of all neighbors for a given x, y coordinate. Neighbors mush share an edge (ie no diagonal moves). Make sure to only return valid nodes. That is, nodes that are within the bounds of the graph and aren't a wall. get_neighbors() takes two arguments, the graph and a node The graph will be a list of lists, as in the example above. The node will be a tuple in the form (x, y). It should return a list of tuples Quick reminder on tuples: # how to make one node (4, 7) # how to access one node [0] node[1] Expected behavior # using the graph defined above neighbors get_neighbors (graph, (e, )) len(neighbors) 2 (e, 1) in neighborsTrue (1, 0) in neighbors-True- neighborsget neighbors(graphas Ien(neighbors) (4,1) in neighborsTrue (3, 0) in neighborsTrue 0 6:17 PM ds) 02/03/2019 ^ share your progrom enhance your work after submitting export to r back to classroom run run tests 1-bef get neighbors(graph, node)