Consider a Binary Search tree with nodes 1, 2 and 3 to be searched for with a given probability. In this problem you assign the probability of search to each node, keep in mind that the sum of the probabilities must add up to one. Answer the following questions: Node key | Probability 1. Show the probabilities you assigned to each node. Find the optimal Binary Search Tree arrangement that will result in the overall minimal number of comparisons in a successful search. You must use Dynamic Programming design strategy. No coding. Consider a Binary Search tree with nodes 1, 2 and 3 to be searched for with a given probability. In this problem you assign the probability of search to each node, keep in mind that the sum of the probabilities must add up to one. Answer the following questions: Node key | Probability 1. Show the probabilities you assigned to each node. Find the optimal Binary Search Tree arrangement that will result in the overall minimal number of comparisons in a successful search. You must use Dynamic Programming design strategy. No coding