Creating Huffman codes using Haskell

Need to implement Huffman codes using Haskell programming langauge. This involves converting single characters and strings into binaries (0's and 1's) and vice versa. Have detailed step by step instructions and relevant diagrams. The program should use trees and functions associated with trees. Should be no problem at all for an experienced Haskell program and should take maximum 3 hours. DETAILED INSTRUCTIONS WILL BE PROVIDED