This is an Algorithm question.

1. List the possible set combinations for the partition problem for set S = {1, 4, 5). 2. What is the best solution for the partition problem for set S = (1,4,5). 3. Use the sorted hill climbing to partition the set S = {35, 62, 79, 72, 86, 74, 26, 3, 1, 56). Show the two sets at each iteration after sorting. 4. Represent a tic tac toe board as an array, that is, map the 2d array into a 1d array. Give the mapping. For example board 2D[0,0] maps to board1D[O]. 5. Write the sets of indices for the 1D array that correspond to a win for either X or 0. 1. List the possible set combinations for the partition problem for set S = {1, 4, 5). 2. What is the best solution for the partition problem for set S = (1,4,5). 3. Use the sorted hill climbing to partition the set S = {35, 62, 79, 72, 86, 74, 26, 3, 1, 56). Show the two sets at each iteration after sorting. 4. Represent a tic tac toe board as an array, that is, map the 2d array into a 1d array. Give the mapping. For example board 2D[0,0] maps to board1D[O]. 5. Write the sets of indices for the 1D array that correspond to a win for either X or 0