$2.$ In class we proved that the binSearch algorithms was correct.

Consider the array A $=[2,3,5,8,11,14,19,22]$ where A is indexed $0.\mathrm{.}7$

$2($b$)$ In the blanks write the correct array values in the array A

Which element$($s$)$ will be found on recursive level $0?\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Which element$($s$)$ will be found on recursive level $1?\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Which element$($s$)$ will be found on recursive level $2?\_\_\_\_\_\_\_\_\_\_\_\_\_\_$