A substring of some character string is a contiguous sequence of characters in that string (which is different than a subsequence, of course). Suppose you are given two character strings, X and Y , with respective lengths n and m. Describe an efficient algorithm for finding a longest common substring of X and Y .For each algorithm:i. Explain the main idea and approach. Write appropriate pseudo-code. Trace it on at least three different examples, including at least a canonical case and two corner cases. iv. Give a proof of correctness. v. Give a worst-case asymptotic running time analysis.

create a 2-dimensional array, let both rows represent the strings X and Y.

check for the common characters within a string and compare them with the other string value.

If there is a match, append it to the array rows.

After iterating over both strings for the substring, get the longest common substring for both strings and print.

Explanation:

The algorithm should create an array that holds the substrings, then use the max function to get the largest or longest substring in the array.

a variable of array type holds a reference of object

array are commonly used in computer program to organize data so that a related set of values

array are using zero base indexing it start with 0.

all component of array have same type, two different types doesn't use in single array

if array are store 10 quantities its index value varies from 0 to 9.

it stores 1st quantity value in index value 0 and this process will same till index value 9.

i believe the two important functions that skype uses are nat traversal and user location.good luck        

explanation: