We have a rectangular grid of points where one corner is (0,0) and the other corner is (W, H), where W, H represent the width and height of the grid, respectively. From each point (x, y), we can move along one of the cardinal directions to (x,y) = {(x+1, y), (x1,y), (x, y + 1), (x, y 1)}, as long as 0 < x 3 2 1 0.5 1 0 0 1 2 3 The red lines show a path from (0,0) to (3, 3). Your algorithm may return a list [(0,0), (1,0), (2,0), (3, 0), (3,1), (3,2), (3,3)] (there is another path in this case and any of them may be returned. Example 2 Consider W = H = 3 and two circles C = {(1, 2, 1), (2, 2, 1)}. 3 1 2 1 0 1 2 3