$(15$ points$)$ Use the following table to construct an OBST $($Optimal Binary Search Tree$)$

$\backslash$table$[[$Items$,1,2,3,4],[$Data$,10,20,30,40],[$Cost $($$$),6,4,2,3]]$