Let T be a Binary Search Tree (BST) with n keys. Select all the statements below which are true.
a) In-order traversal of T gives keys in non-decreasing order.
b) The maximum number of nodes at depth k is 2^k.
c) The minimum number of nodes in a BST with k levels is k+1.
d) Inserting elements into a BST always results in a balanced tree.