Given the following strings: String$1$ s t o n e String$2$ l o n g e s t Find the Longest Common Subsequence $($LCS$)$ using Dynamic Programming. of design and anlysis od algorithm