The binary insertion sort is a variation of the insertion sort that uses a binary search technique (see Exercise 44) rather than a linear search technique to insert the ith element in the correct place among the previously sorted elements. 47. Show all the steps used by the binary insertion sort to sort the list 3, 2, 4,5, 1,6.

Taylor's baseball team played a full 9-inning game. The team scored 4 runs in every inning, and for every 2 runs it scored, it had 5 hits. What is an appropriate process for finding how many total hits the team had? Make a tree diagram with 1 inning as the starting point. Draw 4 branches to represent the runs. Connect every 2 runs to a single node and draw 5 branches to represent the hits. Multiply the number of hits by 9 to find the number of hits in the full 9-inning game. Make a table with one column for runs and one for hits. Start with 4 runs and 2 hits, then increase each column by 5 for 9 rows to find the number of hits in the full 9-inning game. Make a graph with the number of hits on the x-axis and the number of runs on the y-axis. Start at 0 hits and 0 runs, then add 5 hits for every 4 runs. Continue this pattern 9 times to find the number of hits in the full 9-inning game. Make two tape diagrams, one with 4 rectangles to represent the number of runs, and one with 5…