1. Generate all permutations of {1, 2, 3, 4} by backtracking.
2. a. Apply backtracking to solve the following instance of the subset sum problem: A = {1, 3, 4, 5} and d = 11.
b. Will the backtracking algorithm work correctly if we use just one of the two inequalities to terminate a node as nonpromising?