- draw simple undirected graph that has vertices edgesand connected components why would it be impossible to draw with connected components if had edgesr- let be simple connected graph with vertices and edges explain why (log mis (log nr- draw an adjacency list and adjacency matrix representation of the undirected graph shown in figure - draw simple connected directed graph with vertices and edges such that the in-degree and out-degree of each vertex is show that there is single (nonsimplecycle that includes all the edges of your graphthat isyou can trace all the edges in their respective directions without ever lifting your pencil (such cycle is called an euler tour - repeat the previous problem and then remove one edge from the graph show that now there is single (nonsimplepath that includes all the edges of your graph (such path is called an euler path - bob loves foreign languages and wants to plan his course schedule for the following years he is interested in the following nine language coursesla la la la la la la la and la the course prerequisites arela (nonela la