Let connected graph G have vertex set V = {A, B, C, D, E} and the edge set as given below. In each situation, draw G with as few crossings as possible. (12 points) a) E1 = {(A, E); (A, C); (B, C); (B, D); (D, E); (B, E); (C, E)} b) E2 = {(A, B); (A, C); (B, C); (B, D); (B, E); (A, E); (C, E); (C, E); (D, E)} c) List the degrees of each vertex for each graph. Graph E1: Degree(A) = Degree(B) = Degree(C) = Degree(D) = Degree(E) = Graph E2: Degree(A) = Degree(B) = Degree(C) = Degree(D) = Degree(E) = d) for each graph, list three pairs of adjacent vertices (if possible) and three pairs of non-adjacent vertices (if possible). If it is not possible, write "not possible". Graph E1: Three pairs of adjacent vertices are: Three pairs of non-adjacent vertices are: Graph E2: Three pairs of adjacent vertices are: Three pairs of non-adjacent vertices are