Assume a file contains the following characters with the associatedfrequencies displayed in the
table:
a b c d e f g
9 11 6 4 24 12 16
1. how many bits are necessary to store the characters in a fileusing fixed length codes?
2. show the code built using the huffman algorithm
3. how many bits are necessary to store the characters using theprefix code returned by the
huffman algorithm?
4. assume all the characters have the same frequency (say 10). showthe tree built by the huffman
algorithm in that case, and determine the associated number ofbits

Iwould go with either b or c, not sure which one.

Solution: the categorization of functional and non-functional requirement are as follows: some of the more typical functional requirements include: • business rules• transaction corrections, adjustments and cancellations• administrative functions• authentication• authorization levels• audit tracking• external interfaces• certification requirements• reporting requirements• historical data• legal or regulatory requirementswhile,some typical non-functional requirements are: • performance – for example response time, throughput, utilization, static volumetric• scalability• capacity• availability• reliability• recoverability• maintainability• serviceability• security• regulatory• manageability• environmental• data integrity• usability• interoperability

A. newton 's fourth law a liquid in a confined space is not compressed.