Algorithms | Greedy Algorithms | Question 3

A networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains the following characters with their frequency: 

character   Frequency
    a	          5
    b             9
    c             12
    d             13
    e             16
    f             45

Note : Each character in input message takes 1 byte. If the compression technique used is Huffman Coding, how many bits will be saved in the message?