This is a Huffman Tree. Huffman Trees are used to compress characters while transmitting text. Consider the word "BADADD". There are two ways to represent and transmit this text.

$1.$ Through assigning bit codes using the above tree.

$2.$ Through assigning three bits to every character, ex$.$ A$=000,$ B$=001,$ and G$-110$

What is the compression ratio for this text, "BADADD" in this scenario?

Hint: Compression Ratio$=$ Total Data Transfer by Method $1/$ Total Data Transfer by Method $2$

This number is between $0$ and $1.$ Enter the number rounded to two decimal places $($e$.$g$.0\mathrm{.}129$ is entered as $0\mathrm{.}13,0\mathrm{.}012$ is entered as $0\mathrm{.}01).$