PLS give hand writing ans,thx alot

9. (15%) Consider two sequences: GTCA and GGACA. a. (10%) Find their foigest common subsequence using dynamic programming b, (5%) How to improve the dynamic programming to run in O(n) space while allowing backtracting? Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .