Question 15 1 pts Imagine you are writing a classroom management program. In which of the following scenarios will dynamic data structures approach make your program more efficient? O a classroom with a MAX of 24 students, being assigned 24 students O a classroom with a MAX of 24 students, being assigned 15 students O a school building with a MAX of 50 classrooms being assigned 30 classes O a school building with a MAX of 50 classrooms being assigned 50 classes O both b) and c) Question 16 1 pts In a BST the following is not true: O every node has exactly two branches (valid pointers) O all left sub-tree values are smaller that the parent node value O all right sub-tree values are larger that the parent node value O some nodes have O descendants