Hello, i need help in solving these questions.

Suppose v is the value of a node N in a binary search tree. Assume that there is a value higher than v in the tree. Among all the values in the tree, where is that next larger value located? a. somewhere in the left subtree of N b. sometimes in the right subtree of N, sometimes in the parent of N c. always somewhere in the right subtree of N, athough not necessarily in the right child itself d. in the right child of N (always) How many strings of length less than 4 contains the language described by the regular expression (x+y)y(a+ab)? a. 7 b. 12 c. 10 d. 11