Can someone help me understand how to approach this problem? I am learning about Huffman codes and the encoding/decoding algorithm.

Data compression in general, and Huffman encoding as a method, can be used in multiple areas: secure communication, image compression, music streaming, data storage optimization, and other areas. Do the following:

1. Describe an area of interest (and its characteristics), in which data compression is useful.

2. Identify the context of an application of a Huffman encoding-decoding algorithm.

3. Describe in detail, using rigorous mathematical notation: a) The problem/challenge; b) how the use of Huffman algorithm will address the problem/challenge; c) the algorithm itself and all its steps in detail, as it applies to your context; and d) a complexity analysis, with the proof of computational time expected.

4. Choose one component of your methodology and implement using your favorite programming language.

5. Implement a visualization technique in your code, to demonstrate how that component works.