Design a brute force algorithm to find the Longest Common Subsequence $($LCS$)$ of two

sequences.

Implement the brute force algorithm in C$++.$

Include the following in the report as a separate section:

$$ Detail description of your brutal force algorithm.

$$ Compare the results obtained from the brute force algorithm with those obtained from the

dynamic programming LCS algorithm using the same two test cases.

$$ Compare the running time of the two implementations using two very long sequences

generated by you.

$$ Analyze the time complexity of the brute force solution and compare it with the dynamic

programming approach.

$$ Discuss the advantages and disadvantages of each algorithm in terms of efficiency and

applicability to different scenarios.

$$ Conclusions$/$Summary: Summarize whether your brute force algorithm yields accurate

results and its performance compared with the dynamic programming LCS algorithm.