Hello, need help with question 1. Graph trees problem

Graphs/T lain why no such paph exists each of the falowing draw a graph folowing the specifications or ap ee, five vertices total degree 8. simple graph, connected. six vertices, six edies 3- Graph, vertices one edge, not a tree. Isomorphism of Graphs: hind old city. hotce apha Kua document listing their agrnti in a n 1953, the CIA managed la towing their past operations duties, and contacts among themsewns.Unfortunately, t ived the eerts try the code desgrations DthroughLThe doouments shows that agents o'scontacts were F and and rs-ere r, Hand K rs were E.F re J and K: F's were D 1 and L and H.K's were E and tand L's were D, F and G Draw an edse between agents it they are contacts. Call the graph A tely, the irrormatio he document ittle use without the identities ot the agents Aninquiry the CIA office in thin city reveals that the sunpected ageltsthere were Telyanin. Rostov. Lawrushka, karugin. Ippoli, Walaski Dolokhov, Balashev and Kutuaow. ed the contact graph presented beicwh Pant mer tings the CIA rrea uragin 2. Showthat the Raphs A and Care isomorphic. Find the mapping between the code designation and the agents' names Huffman Codes uffman coding to encode the following symbob with the frequencies listed