Question 4 10 points Save Answer Consider the optimal Binary Search Tree problem with four nodes a1=A, a2=B, a3=C, a4=D to search for with probabilities of 0.2, 0.4, 0.3, 0.1 respectively. Let Cli,j) be the smallest average number of comparisons for a successful search in a Binary Search Tree a, ...,aj. How is C(2, 3) evaluated? C(2, 3) = max { C(2,3), C(3,4)} +0.7 C(2, 3) = max[(C(2,3)+C(3,4)), (C(2,2)+C(4,3)}] +0.7 C(2, 3)= max { C(2,2), C(3,3)} + 0.7 C(2, 3) = max [(C(2,1)+C(3,3)), (C(2,2)+C(4,3)}]+0.7