1 Insert the following values into a binary search tree (BST), one by one. Show the resulting BST 8 11 17 14 352 21 13 12 1 Show the output from in-order, pre-order, and post-order traversals of the resulting tree. . Write a recursive function that counts how many nodes in a tree have a single child. The function signature is:int countOnechi ld(node root) 3. Identify the height and balance factor of each node in the following BSTs. Then, balance these trees if needed and show the design of the tree after each rotation. 14 2 21 17 40 42