Using the Huffman codes shown in Table 1, complete the partial Huffman tree shown in Figure 1 by identifying which character belongs in each of the empty leaves: Leaf X, Leaf Y, and Leaf Z.
| Character | Binary code |
|---|---|
| T | 0 |
| A | 10 |
| P | 110 |
| S | 111 |

State the character for:
Leaf X
Leaf Y
Leaf Z