1. 25 points You are given a simple scheduling problem. You have a group of m people and a set of n tasks, each with a duration. Assume that n > m. You want to assign tasks to people so that the time when the last task is completed is minimized. Answer the following questions. Explain briefly your reasoning: 1. Describe how you would represent the state space, including the initial state, successor function, cost function, and goal test. 2. Is the search space a tree or a graph