The table gives the weights of a weighted graph G on vertices U, V, W, X, Y, Z. All the edges appear in the table (so for instance VZ is not an edge in the graph). Edge Weight Edge Weight Edge Weight UX 1 UV 3 UW VX 1 YZ 3 XY 6 WY 1 WX 4 XZ 8 ᏙᎳ 2 WZ 5 UZ 9 Use Dijkstra's algorithm to find a minimal path from U to Z. We now consider an graph G' whose vertices and edges are the same as G, but which is not a weighted graph. Sketch a planar diagram of G'.