Write an algorithm, in pseudocode, that given a Huffman tree, set up a table containing the code to be used to compress each character contained in the tree. The table to be returned must be a matrix with two columns, where the second column contains the code corresponding to the character with you in the first column.