The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:
$$\text{D K E F B G L M H I J C A.}$$
For each node of $T$, the degree (i.e., the number of edges incident on a node) is given in the table below.
$\begin{array} \text{Node} & A & B & C & D & E & F & G & H & I & J & K & L & M \\ \text{Degree} & 3 & 5 & 4 & 1 & 1 & 1 & 1 & 3 & 1& 1& 1& 1& 1 \end{array}$
Reconstruct and draw the tree $T$.