In the beginning, split the problems to find the simple ones, but towards the end, find a problem you think you can solve (because of the scoreboard or because you like it), and work on it as a team. Typical distribution: 1 person typing 1 person solving a new problem 1 person helping the other 2: spotting typos or working on problems. Implement Needleman-Wunsch’s \(O(n^2)\) DP algorithm Implement Dijkstra’s algorithm Implement Ukkonen’s \(O(nd)\) band-doubling algorithm Optional: Implement the Seed heuristic Optional: Implement A*PA Very optional: Implement the \(O(d^2)\) diagonal-transition/WFA algorithm (Ukkonen 1985; Myers 1986; Marco-Sola et al. 2021).