QUESTION 13 We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? O n! QUESTION 14 Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex v at a distancefour from the root. If v is the n th vertex in this BFS traversal, then the maximum possible value of n is 0 15 0 16 31 32 64