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.

Formulate the problem using a state-space search representation.

Describe (precisely):

1. how you would represent the states (i.e., what information needs to be included in any state to make sure the state describes all the information you need to apply the actions);

2. what is the initial state;

3. what goal test you would use;

4. wjat are the actions;

5. what cost function you would use;

6. is the state-space a tree or a graph?