For each of the six possible permutations of the team members (first, second, third) the problem is solved using dynamic programming. The state consists of the task we are currently on and the team member (first, second or third) whom the previous task has been assigned to. When making a transition, we choose if we want to assign the current task to the same or the next team member. Dynamic programming can be implemented recursively, using memoization. Of course, an iterative implementation is also possible.