Consider the graph with vertex set V = {(x, y) x, y = 1, 2, ..., 1000}, = and where the edges are defined like this: (x, y) is adjacent to (connected to) all of the points in the list (x+1, y), (x+2, y), (x-1, y), (x-2, y), (x, y+ 1), (x, y + 2), (x, y - 1), (x, y - 2) that belong to V (so, if (x, y) is near the center of the grid V, then the points it is adjacent to form a giant + sign). Is the graph planar? Prove your answer. (Hint: Why use a heavy tool when a simpler one will do?)