2. Considering the following graph, use the exhaustive-search approach for the Traveling Salesman problem to (1) draw the tree of all possible tours, (2) identify the cost of each tour, (3) identify the redundant (repetitive) tours, and (4) make a connection between the time efficiency of this approach in general and the number of tours identified for this particular problem. 15 6 8 D 8 16 12 B 5. Expand the following table to show how the Binary Search algorithm searches for the key k = 10 in the given array. The first row (below the heading) corresponds to the variables before the while loop begins. Each row after that represents the end of one iteration of the loop. Please leave comments clarifying your decisions for each row of the table. A = [5, 8, 10, 10, 11, 15, 19, 20, 20, 21, 25, 28, 29, 33, 35, 36, 40, 40, 41] Iteration No. 1 r m