A tree 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 childrennodes: F$-$J$-$D$-$H$-$E$-$G$-$K$-$C$-$I$-$B$-$A number of leaves: $$0-1-0-0-3-0-0-0-3-1-2$$

$($for example, the node $$\backslash$mathrm$\{$E$\}$$ has $3$ children and the node $$\backslash$mathrm$\{$G$\}$$ is a leaf$)$

Which of the following is the preorder traversal sequence of this tree?

C$-$G$-$J$-$H$-$A$-$F$-$I$-$B$-$D$-$K$-$D

D$-$I$-$C$-$H$-$A$-$G$-$E$-$B$-$F$-$K$-$J

A$-$E$-$J$-$F$-$D$-$H$-$B$-$I$-$G$-$K$-$C

D$-$E$-$J$-$H$-$A$-$F$-$I$-$B$-$G$-$K$-$C

I$-$E$-$A$-$H$-$J$-$F$-$D$-$B$-$G$-$K$-$C

D$-$E$-$F$-$H$-$K$-$I$-$F$-$B$-$G$-$A$-$C

D$-$F$-$J$-$B$-$G$-$E$-$I$-$H$-$A$-$K$-$C

D$-$E$-$J$-$H$-$A$-$F$-$I$-$B$-$G$-$K$-$C

I$-$E$-$A$-$H$-$J$-$F$-$D$-$B$-$G$-$K$-$C

D$-$E$-$F$-$H$-$K$-$I$-$F$-$B$-$G$-$A$-$C

D$-$F$-$J$-$B$-$G$-$E$-$I$-$H$-$A$-$K$-$C

D$-$E$-$H$-$J$-$A$-$J$-$I$-$B$-$G$-$F$-$C

C$-$E$-$K$-$H$-$A$-$J$-$I$-$B$-$G$-$J$-$D

D$-$A$-$J$-$H$-$E$-$K$-$I$-$B$-$E$-$F$-$C

A$-$E$-$C$-$H$-$D$-$I$-$F$-$B$-$G$-$K$-$J