Strand $1$: ABCDGH Strand $2$: AEDFHR $1.$ Use dynamic programming approach to determine the length of the Longest Common Subsequence $($LCS$)$ of above two strands. No need to write code. $2.$ Also reconstruct the LCS in the final stage.