2 a) Write down step by step instructions that will find the longest common subsequence (LCS) of two strings X and Y using the brute force approach. You may assume that (X) = m and Y] = n. Explain what would be the time complexity of determining the LCS using this approach. b) Write down a DP solution to find the LCS(X, Y). You need to simply provide formulas/equations/relationships that finds the LCS(X, Y). State the time complexity of determining LCS(X, Y) using this approach. c) Find the LCS (X, Y) where X = "abcda" and Y = "cbadca. Show all your steps including the arrows