please help

NAME: e nodes of the se e order in which i nk 5. For the following graph G with edges (1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8), (8,9), (9,10), (10,11),(11,12), (10,1), (3,8), (5,9), (7,2) either prove that G is non-planar or draw G without self-intersections HAME des of the der in whi 4. Given a graph below What are the neighbors in the minimum spanning tree (MST) of the node H and the node F . By how much the weight of edge (Y.C) should be reduced to make this edge added to MS? At least by The edge _will be knocked out of MST. -By how much the weight of edge (1,G) should grow to be knocked out of MST? At least by The edge will be added to MST X 1935H 10 15 - D 0 16 23 27 10 Os