Search in a Binary Tree Given a binary tree {8, 3, 11,2, 6, 9, 14, #, #, 4, 7, #, #, 13}, the first data is the root node, followed by the value of the left and right child nodes, and "#" indicates that there is no child node. 8 . 3 11 / 2 6 9 14 / 4 7 13 Short Answer Question: 1. (2 pts) Is this a Balanced Binary Tree? Provide answer and explain why. 2. (2 pts) Is this a Complete Binary Tree? Provide answer and explain why. 3. (2 pts) Is this a Binary Search Tree? Provide answer and explain why