(20 Points) Let T be a Binary Search Tree containing the keys {1,2,3,4,5,6,7,8,9,10,11,12}. Suppose that a post-order tree walk prints the keys in order: 1,3,2,5,7,6,8,10,9,12,11,4. Determine the structure of T. Present your solution either by drawing a picture of the tree, or by constructing a table giving the parent of each Node