2. Insert the keys 8, 6, 3, 2, 7, 5 into an empty binary search tree in this order. Please answer (a) preorder traversal, (b) postorder traversal and (c) breadth-first traversal of the binary search tree.(20%)