Urgent true and false please

e or False (2pts/ea, total 2*10-20pts) a) (T or F) Every node in a tree has exactly one parent node. b) (T or F) Each node in a tree can have multiple successors (children) c) (T or F) There can be many alternate paths between the root node of a tree and some other specific node. d) (T or F) Our binary search tres can hold duplcac objects (T or F) A binary search tree is a binary tree with the added property that the left child is greater than the parent, which is less than or equal to the right child. e) (T or F) In-order traversal means visit the left child, then the right child, then the node. g) (Tor F)A tree is a graph. h) (Tor F)A graph is a tree. i) (Tor F) Only Comparable objects can be stored in an ordered list. j) (T or F) Any recursiv e definition must have a non-recursive part, called the base case, which permits the recursion to eventually end