Enter text: Mississippi has a number of repeated letters. ASCII Code Character Frequency Code 32 6 100 46 1 010010 77 1 111100 97 a 3 0111 98 1 00100 100 d 1 111101 101 e 101 102 f 1 00101 104 1 00110...

java help please with the following images.

Extracted text: Enter text: Mississippi has a number of repeated letters. ASCII Code Character Frequency Code 32 6 100 46 1 010010 77 1 111100 97 a 3 0111 98 1 00100 100 d 1 111101 101 e 101 102 f 1 00101 104 1 00110 105 i 4 00 108 1 1 00111 109 m 1 111110 110 1 111111 111 1 01000 112 3 1110 114 3 0101 115 6 110 116 3 0110 117 u 010011 H LO


Extracted text: Character Code Frequency M 000 001 2 01 4 i 4 M P (a) Huffman coding tree (b) Character code table Mississippi - 000101011010110010011 Write a program that converts a sentence to its equivalent Huffman encoding. The input from the keyboard consists of a stream of ASCII characters (a sentence). Only the graphical characters (with ASCII codes between 32 and 126 inclusive) are counted; all others (e.g. tabs, newlines and carriage returns) are ignored. Assume proper input. Output to the screen a table with the ASCII value, character, frequency, and code for each character in the string in a column format. A binary tree structure must be used. Refer to the sample output below. Sample Runs (2): Enter text: Mississippi ASCII Code Character Frequency Code 77 M 100 105 i 4 112 2 101 115 4 11