4. In the 0-1 Knapsack Problem, a node is nonpromising if the total weight thus far is greater than or equal to W. (True or False) Backtracking algorithm don’t depend on the set of data they are given. (True or False) 5. If we write a backtracking algorithm for the Sum-of-Subsets problem that does not sort the weights in advance, it gets slower. (True or False) 6 In branch-and-bound algorithm and its variants, we are limited in a fixed way to traverse the tree. (True or False) 7.