What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a graph with k+1 vertices. d). Assume the theorem holds for all graphs with k-1 vertices. e). Let G be a graph with k-1 vertices.

What is the next line of the proof? a). Add a vertex to G to create G’. b). Delete a vertex from G to create G’. c). Add an edge to G to create G’. d). Delete an edge from G to create G’.

How many different spanning trees does the given graph have? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). 8

Is K 4 planar? a). Yes b). No c). I have absolutely no idea

Is K 2,3 planar? a). Yes b). No c). I have absolutely no idea

Is K 5 planar? a). Yes b). No c). I have absolutely no idea

Is K 3,3 planar? a). Yes b). No c). I have absolutely no idea