All of the steps please.

a. 4. A 1024 x 1024 8-bit gray-level image with entropy of 5.3 bits/pixel is to be Huffman coded: What is the maximum compression (upper-bound) that can be achieved? b. Will it be achieved in practice? c. If a greater level of lossless compression is required, what else can be done? 5. Given the probability for each symbol for a 4-symbol source is shown below. Symbol Probability A 0.1 B 0.2 0.3 D 0.4 The following arithmetic code is received for a 3-symbol message: 0.25. Decode the code to produce the message. Show the steps involved. D A 0