A university wishes to allocate projects to students. There exist a set of projects and a set of students. No two students can take the same project. Each student ranks their top 10 projects in order. It is decided to use a genetic algorithm to find a solution to the allocation problem. Explain how you would apply a genetic algorithm to find a solution. Your answer should include a description of suitable fitness function, a suitable representation of the chromosomes, and a description of the operators.
