Construct a Huffman tree for a file that contains a single string "dsa is dsa". Use the following constraints when building the tree:

$$ the node with a lower frequency is attached to the left in case two nodes are merged after extraction from the priority queue;

$$ if two nodes have the same priority when merging and when ordering, then the nodes are resolved as follows:

$$ if both nodes have letters $($a$.$k$.$a$.$ leaf nodes$)$ then the letter with lower ascii value will be the left node when combining two nodes into a tree, or have the higher priority in a heap. Ascii value of space is $32,$ a is $97,$ d is $100,$ i is $105$ and s is $115.$

$$ if one or both nodes have cumulative frequencies, then the node with the larger subtree will be attached to the right, or be prioritized after the smaller tree in a heap.

For instance, when comparing a leaf node $($character$)$ with a cumulative frequency, the leaf would be prioritized in a heap and be merged on the left side $($with the cumulative node on the right$).$

$$ if one or both nodes have cumulative frequencies, and each of the trees have the same number of nodes, then you can merge them in any order.

$$ traversing left from a node appends $\text{'}$O$\text{'}$ to the Huffman code and traversing right appends $\text{'}1.$

Decode the following Huffman code using the tree: $01000111111010$