3. (8 pts) A Binary Search Tree. a) Draw a minimum height of a binary search tree with 7 nodes and give an example of an input sequence of 7 positive integer values for this binary search tree if this tree is constructed by repeated insertion operations. b) Draw a maximum height of a binary search tree with 7 nodes and give an example of an input sequence of 7 positive integer values for this binary search tree if this tree is constructed by repeated insertion operations