Fall2018 L Ghemri 1) Isomorphism of Graphs: 3 1. Show that the graphs above are isomorphic by building their adjacency matrix. 2. Find the mapping between the vertices of the graphs 2) Huffman Codes The following eight-symbol alphabet with associated relative frequencies was designed to efficiently encode the lyrics of 1950s rock songs. (Note that the "symbols" of an "alphabet" need not be individual letters.) A 2 NA 16 BOOM SHA 3 GET 2 YIP9 08 2 WAH 1 Find a Huffman code for these symbols and use it to code the following lyrics Get a job Sha na na na na na na na na Get a job Sha na na na na na na na na Wah yip yip yip yip yip yip yip yip yip Sha boom How many bits are required for the encoding? What is the smallest number of bits that would be needed to encode this song if we used a fixed-length code for the eight-symbol alphabet