A pseudo-complete binary tree is a binary tree that becomes a perfect tree when the bottom level is removed. Consider the OBST problem for the sorted array aa1 < aa2 < ⋯< aann where all the qqii’s are equal to 0 and all the ppii’s are equal to 1 nn. Prove that the optimal binary search trees in this case are the pseudo-complete binary search trees.