5. (10 pts) Below, please show the steps of the binary search algorithm when searching for 15 in the array shown Show the steps involved. Note that 15 is not in the array. Note that the algorithm as shown in the book must do an actual recursive call on an array of size 0 before it determines that the element is not found. Show that call as well. An example of a solved problem is given in the handout: http://cs.ucsb.edu/richert/cs32/misc/h06- handout.pdf target-15 values passed in array values values passed to next step middle step first size first passed in passed in sizefirst size/2) middle+1 (size-1)/2 step 1 0 step 2 step 3 step 4 step 5 50+(11/2)