Planar Graphs · Medium problem

Take $K_{4,4}$ (the complete bipartite graph with parts of size $4$ each) and remove a perfect matching (a set of $4$ non-adjacent edges, one from each vertex pair). Is the resulting graph planar?