a. Construct a Huffman code for the following data: symbol frequency A B C D 0.4 0.1 0.2 0.15 0.15 Encode ABACABAD using the code of question (a). Decode 100010111001010 using the code of question (a)

This is the 3rd time I am asking this question. Previous answers were wrong or incomplete. Please, do not copy old answers for me. I will upvote if you provide a workable code. Here is the code and tree I have already provided if it's helpful. Please use the tree: tree = {    9: ['N',{'node': 6, 'branch': 0.1}, {'node': 8, 'branch': 0.5}],    8: ['N',{'node': 3, 'branch': 0.75}, {'node': 7, 'branch': 0.1}],    7: ['N',{'node': 4, 'branch': 0.1}, {'node': 5, 'branch': 0.15}],    6: ['N',{'node': 1, 'branch': 0.5}, {'node': 2, 'branch': 0.25}],    5: ['L'],    4: ['L'],    3: ['L'],    2: ['L'],    1: ['L']}# Write code to solve problem here: # Open the file and read the contentswith open('SSA_regions.fasta', 'r') as f:    file_contents = f.read() # Split the contents by sequencesequences = file_contents.split('>') # Initialize an empty dictionary to store the sequencessequence_dict = {} # Loop over the sequencesfor sequence in sequences[1:]:    # Split the sequence into header and…

35 DO NOT COPY FROM OTHER WEBSITES Correct and detailed answer will be Upvoted else downvoted. Thank you!

want unique answer