10. (5) For the following problem, choose an appropriate minimal change algorithm for either subsets or permutations and generate your subsets/permutations with it and list them in order. 11. (10) Show all the possible assignments-pen and paper exhaustive search-and their costs for the assignment problem for the following cost matrix (see previous problem). Indicate the optimal solution: Job O Job 1 Job 2 7 Person 09 Person 1 6 Person 2 5 8