Answer the following questions TRUE or FALSE. Dont supply an explanation or proof.

a) In a MAX-HEAP in which, the all the values are different, the smallest value in the heap must be in one of the leaves of the HEAP.

b) A Red-Black Tree can sometimes have more Red Nodes than Black nodes.

c) Deletion in a Binary Search Tree takes time w(log n).

d) In RadixSort, you first put data into buckets based on the most significant digit, then the next most significant digit, maintaining data in queues until you get to the least significant digit.

e) Every path from the root to a leaf in a Red-Black Tree has the same number of nodes in it.

f) Hash Tables are a good data structure for answering range queries, such as finding all employees whose salary is more than 5000.