Two character strings may have many common substrings. Substrings are required to be contiguous in the original string. For example, photograph and tomography have several common substrings of length one (i. e., single letters), and common substrings ph, to, and ograph (as well as all the substrings of ograph). The maximum common substring (MCS) length is 6. Let X = x1x2 xm and Y = y1y2 yn be two character strings. Using dynamic programming, design an algorithm to find the maximum common substring length for X and Y using dynamic programming.