Atree can be uniquely determined by specifing its postorder sequence and number of leaves for each node. Let's consider a tree with the following postorder sequence of its nodes and corresponding number of children nodes. F-J-D-H-E-G-K-C-I-B-A number of leaves 01003000312 (for example, the node E has 3 children and the node G is a leaf) Which of the following is the preorder traversal sequence of this tree? D-I-C-H-A-G-E-B-F-K-J I-E-A-HJJ-F-D-B-G-K-C AECHDHFBGKJ C-G-J-H-A-F-I-B-D-K-D C-E-K-H-A H-1-B-GJ-D D.F-J-B-G-E-I-H-A-K-C D-A.J-HE-K+B-E-F-C