i want the answer clearly

1 of 1 HW #2 Digital Communications (ENC 251) (Ch3 : Source Coding) Q1. What is the difference between lossy and lossless Data compression techniques? Q2. Suppose we have a discrete source that generates five symbols with the following probabilities: Character Probability Codeword ? K 0.19 R 0.25 M 0.3 P 0.12 Q ? a. What is the probability of character Q (ie p(Q))? b. Use Huffman encoding algorithm to compress this source. (Draw the tree) Symbol R M P Q codeword c. What is the average code length (L)? d. What is the Entropy of the source (H)? e. Is the system a lossy or lossless system