Give me the python code.

Implement the recursive algorithm and the dynamic algorithm for the Longest Common

Subsequence $($LCS$)$ problem.

Using your implementation report the LCS and the length of the LCS for the following two

strings.

Also report how long it takes $($in microsecond$)$ the recursive algorithm and the dynamic

algorithm to compute this answer.

EKRGFQCMQARWEWJCMTCXKBJGYFOKFNBSDGQIBJZUTCIZUYESZA

OGDHNATFXNCPPYTBTRCCNPZVZGQJBKADFEMWJEJQYMOISFFKSP