$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$

$($a$)$ We call binSearch as follows: binSearch$($A$,0,7,22)$

Draw the box trace $($stack frame$)$ diagram of the call as we did in class. Label each box with the correct recursive level and include in your diagram how the return value gets back to the call.