Asource has an alphabet {a1 , a1, a3, a4} with corresponding probabilities {0.1, 0.2, 0.3, 0.4}. 1. find the entropy of the source. 2. what is the minimum required average code word length to represent this source for error-free reconstruction? 3. design a huffman code for the source and compare the average length of the huffman code with the entropy of the source. 4. design a huffman code for the second extension of the source (take two letters at a time). what is the average code word length? what is the average number of required binary letters per each source output letter? 5. which is a more efficient coding scheme: the huffman coding of the original source or the huffman coding of the second extension of the source?

answer: 500 wph.

explanation:

answer:

i dont know the answer but good luck

explanation:

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)