Give a complete formulation for each of the following problems.a. [LCS problem]

Give a complete formulation for each of the following
problems.a.
[LCS problem] Find the longest common subsequence of
any two sequences of symbols which have no repeated symbol.b.
[ACS problem] Find the set of all common subsequences
of any two sequences of symbols which have no repeated symbol.E2.8 (To be assessed
submission deadline: 5pm Monday 14 October 2013)a.Design
and implement in Matlab an algorithm for the LCS problem.b.
Design and implement in Matlab an algorithm for the ACS
problem.c.
Design and implement in Matlab polynomial algorithms
for both the LCS and ACS problems.