1. Given the following coding scheme, find the word represented by the given
   encodings. (Taken from Rosen Discrete Math text.)
      a: 001
      b: 0001
      e: 1
      r: 0000
      s: 0100
      t: 011
      x: 01010
   (a) 01110100011
   (b) 0001110000
   (c) 0100101010
   (d) 01100101010

2. Show the Huffman tree that results form the following distribution
   of punctuation characters and digits. Frequency is in parentheses. 
      colon(100), space(605), newline(100), comma(705),
      0(431), 1(242), 2(176), 3(59), 4(185),
      5(250), 6(174), 7(199), 8(205), 9(217).