DAA questions test on monday

1> define OBST
2> write the algorithm to find minimum cost BST and its complexity
3>let n=4( a1,a2,a3,a4)=(do,if,int,while) let p[1:4]=(3,3,1,1,) and a(0;4)=(2,3,1,1,1,) intially we have w(i,i) =9(i),c(i,i)=0 r(i,i)=0;0<=i<=4 construct the BST and find its cost