IN PYTHON

Question $2(29$ marks$)$

This question can be answered after studying Chapter $23($Dynamic Programming$).$ It assesses the learning outcomes:

Develop and apply algorithms and data structures to solve computational problems.

Analyse the complexity of algorithms to support software design choices.

Explain how an algorithm or data structure works, in order to communicate with relevant stakeholders.

Write readable, tested, documented and efficient Python code.

In this question we aim to solve the same problem as in Question $1$ given any two DNA sequences $($strings containing only C$,$ G$,$ A or T$)$ find their longest common substring $$ but using a different approach.

You should provide a dynamic programming solution,