Suppose is an initially empty search tree and we insert the sequence of keys 1,2,3,n, in increasing order, into . Then the height of the resulting search tree is

a. (log) if is a Splay tree, but is () if is a BST

b. (log), regardless of whether is a Splay tree or an AVL tree

c. (), regardless of whether is a BST or a Splay tree or an AVL tree

d. () if is a Splay tree, but is (log) if is an AVL tree