5 A sorted sequence of n numbers are stored in array A[1..n]. The binary search algorithm (refer to notes of Chapter 2) can be modeled by a decision tree called a binary search tree. Examples for small n are given bellow, where a small square box represents an unsuccessful search.
Prove that the leaves of any binary search tree are located in the bottom two levels.