This is an example to for solution list of 10 elements:

1. Draw the decision tree for the binary search algorithm for a list of 12 ele- ments. For the internal nodes of your decision tree, the node should be labeled with the element checked, the left child should represent what hap- pens if the target is less than the element checked, and the right child should represent what happens if the target is greater than the element checked. 4. 5 2 8 1 3 6 4 7 10 5