CODE IN MATLAB

Suppose you are given two sequences of digits $($each digit is a num$-$

ber from $0,1,2,$dots,$9.$ The goal is to find the longest common subse$-$

quence of these two sequences. A subsequence does not have to occupy

consecutive positions in the original sequence. For example, if the original

sequence is

$1,3,9,6,7,2,1,8,5,4$

then $(9,7,2,4)$ is a possible subsequence, even though they are not

consecutive in the original sequence:

$1,3,9,6,7,2,1,8,5,4$

Write a program in order to determine the length of a longest com$-$

mon subsequence, given two sequences. Here is a numerical example

$($a longest common subsequence is marked in red$)$ for you to check

your codes.

Suppose you are given the following two sequences:

$1,3,9,6,7,2,1,8,5,4$

$3,0,8,9,2$

The longest common subsequence has length $3.$ Your output for

this example should be $3.$

Questions: Consider the following two sequences:

$1,3,9,6,7,2,1,8,5,4$

$3,0,4,3,5,9,2,6,1,1,8,0$

What is your output?

Remark: In this problem, we are only asking for the length of a

longest common subsequence. Interested students may also want to

think about how to identify a longest common subsequence.