Question $3$: Dynamic Programming Problem: You are developing a plagiarism detection tool for a publishing house. Implement a Longest Common Subsequence $($LCS$)$ algorithm to compare two text documents and identify matching sequences. Extend your implementation to output all possible matching sequences in case of multiple results. Input Format: $$ Two text documents as input strings. Expected Output: $$ Length and content of the longest matching text sequences. $$ All possible matching sequences if there are multiple results. Deliverables: $$ Code implementation $$ Example input$/$output with detailed explanation $$ Complexity analysis $($time and space$)$