I need help writing this python code involving Huffman Tree Prefix Codes.

Any help would be greatly appreciated.

Using Python / Jupyter Notebook (Print Running Code)

Only using packages included in standard python (scipy, numpy, etc)

The Output should be only Yes or No.

There will be no more than 10,000 code words in the file, need the code to end within 30 seconds.

* NOTE: The mention of a .txt file in generic in that the only thing in said .txt file would be codes shown above in the example.

4. Write a python program to check if a given code is a prefix code. The input to your code will be provided in a .txt file with each code word in a separate line. The following is an example .txt file: 100 110 4. Write a python program to check if a given code is a prefix code. The input to your code will be provided in a .txt file with each code word in a separate line. The following is an example .txt file: 100 110