Just looking for a drawn decision tree diagram with pruning.

Exercise 2 (Traveling Salesperson Problem by Brute Force) Suppose we have a directed graph (like below with n vertices labeled 1 through n, im- plemented using an n by n matrix where row i, column k contains the weight of the edge going from vertex j to vertex k, or a dash if there is no edge from j to k. The Traveling Salesperson Problem (TSP) is, given this weight matrix as input, determine the cycle-a path that starts at vertex 1, hits all the vertices exactly once, and ends up back at vertex 1that has smallest total weight of its edge. Note that the minimum weight cycle might be o. Figure out how to use the brute force technique to solve an instance of this problem, and demonstrate your algorithm on the matrix below. Be sure to think about pruning, and what information should be kept in each node. - 9 3 7 L 12 - - - 8 9 3 2 - 12 6 vler - 77 5 10 4 9 - 5 7 Exercise 2 (Traveling Salesperson Problem by Brute Force) Suppose we have a directed graph (like below with n vertices labeled 1 through n, im- plemented using an n by n matrix where row i, column k contains the weight of the edge going from vertex j to vertex k, or a dash if there is no edge from j to k. The Traveling Salesperson Problem (TSP) is, given this weight matrix as input, determine the cycle-a path that starts at vertex 1, hits all the vertices exactly once, and ends up back at vertex 1that has smallest total weight of its edge. Note that the minimum weight cycle might be o. Figure out how to use the brute force technique to solve an instance of this problem, and demonstrate your algorithm on the matrix below. Be sure to think about pruning, and what information should be kept in each node. - 9 3 7 L 12 - - - 8 9 3 2 - 12 6 vler - 77 5 10 4 9 - 5 7