1. Find an optimal edit sequence from GRADALGO to RAGALOG by following the space-optimal technique discussed in Lec 11. Show all the intermediate steps and the filled memos during the recursive calls.

2. Solve the recurrences for space and time complexity of Hirscheberg's technique (Lec 11).