How can draw a tree for this question?

List the keys `(1, 2, 3, 4, 5, 10, 9, 8, 7, 6)`

in a correct order so that their insertion in that order produces

a) `a BST with max possible height`

b) `a BST with min possible height`

Show the resulting tree for each case.