<p dir="ltr"><img src="https://d2vlcm61l7u1fs.cloudfront.net/media%2Fa7c%2Fa7ca1492-8d9c-4e00-a2ce-7c255731dca5%2Fimage" alt="%) Given two sequences: CAACT and CACGT Find their longest Common Subsequence (LCS) tabular (25 (10%), bottom-up using dynamic programming. You should write down the computation (10%),