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