-----Description----- 
This task requires writing a Lean 4 method that finds the length of the logest common subsequence of two input arrays.

-----Input-----
The input consists of two arrays:
a: The first array.
b: The second array.


-----Output-----
The output is an integer:
Returns the length of array a and b's longest common subsequence.

