How many bits would be saved in a message if we use Huffman coding as a compression technique to encode the message before transmitting it over the network, given the message consists of the characters with their corresponding frequencies as follows: (Character, Frequency) a: 21, b: 4, c: 2, d: 3, e: 10, f: 20. Note that each character in the original message requires 1 byte (8 bits).