📝 **Task:** Write `lcs(a, b)` returning the length of the longest common subsequence. Print `lcs('abcde', 'ace')`. Expected: 3 📋 Edit the starter code. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.