#ACE_Test_Series
Consider the following instance of OBST (Optimal Binary search Tree) problem. N = 4; <$a_1$, $a_2$, $a_3$, $a_4$> = <do, if, int, while> P(1...4) = <3,3,1,1>; Q(0...4) = <2,3,1,1,1> The cost of OBST is________.
Consider the following instance of OBST (Optimal Binary search Tree) problem.N = 4; <$a_1$, $a_2$, $a_3$, $a_4$ = <do, if, int, while>P(1...4) = <3,3,1,1>; Q(0...4) = <2,...