Please write the following Huffman Codes program in C++

DESCRIPTION, IF NECESSARY:

Questions and input structure The input consists of 6 integers, one per each line. Each integer represents the frequency of characters, A, B, C, D, E, and F, in this order. The test cases have been built so that while building trees it never happens that the same frequency appears twice. Then, the decision about which tree goes to the left and which one goes to the right is always straightforward, and the final tree should be unique. Examples of input and output Input 15 11 5 1 2 4 Output A:0 B:10 C:110 D:11100 E: 11101 F:1111 See the lab guidelines for submission/grading, etc., which can be found in Files/Labs