Graphs/Trees: For each of the following, draw a graph following the specifications or explain why no such graph exists 1- Tree, five vertices, total degree 8. 2. Simple graph, connected, six vertices, six edges. 3- Graph, two vertices, one edge, not a tree. Isomorphism of Graphs: In 1953, the CIA managed to photograph a KGB document listing their agents in a large third-world city, showing their past operations, duties, and contacts among themselves. Unfortunately, it listed the agents by the code designations D through L. The documents shows that agents D's contacts were F and L; E's were j and k; F's were D, J and L; G's were I an L; H's were I and s, I's were G, H and K: J's were E, F and H, K's were E and I; and L's were D, F and G. 1. Draw an edge between agents if they are contacts. Call the graph A. Unfortunately, the information in the document is of little use without the identities of the agents. An inquiry to the CIA office in this city reveals that the suspected agents there were Telyanin, Rostov, Lavrushka, Karugin, Ippolit, Willaski, Dolokhov, Balashev and Kutuzov. Examining records of past meetings, the CIA created the contact graph C (represented below)