After examining and rejecting the middle entry in an array, the binary search algorithm continues its search by dividing the array into two pieces and then ignoring one of the pieces. Create an...

After examining and rejecting the middle entry in an array, the binary search algorithm continues its search by dividing the array into two pieces and then ignoring one of the pieces. Create an analogous recursive search method that divides the array into three pieces after examining two entries and failing to locate the desired target.