Let T be a binary search tree used to implement a dictionary (a) Give the definition of binary search tree. (b) What is the complexity of algorithm Find(k) (seen in class), which returns an entry of T with key k (f any)? (c) Let v be a node of T, and T_v be the subtree rooted at v. Design a recursive algorithm CountGE(v, k) which, given an input node v and a key k, returns the number of entries in T_v with key at least k