R-13.1 Draw a simple undirected graph G that has 12 vertices, 18 edges, and 3 con- nected components. Why would it be impossible to draw G with 3 connected components if G had 66 edges? R-13.2 Let G be a simple connected graph with n vertices and m edges. Explain why O(log m) is O(logn).