4. A binary search tree (BST) can be uniquely reconstructed from its postorder traversal. Draw the BST that corresponds to the following postorder traversal sequence: (10%) $$A \rightarrow C \rightarrow B \rightarrow E \rightarrow G \rightarrow F \rightarrow D \rightarrow H$$