characterswe can find the longest common subsequence of and in (nmtime justificationalgorithm lcs computes [ , ]the length of longest common subsequencein (nmtime given the table of [ijvaluesconstructing longest common subsequence is straightforward one method is to start from [nmand work back through the tablereconstructing longest common subsequence from back to front at any position [ij]we can determine whether if this is truethen we can take as the next character of the subsequence (noting that is before the previous character we foundif any)moving next to [ if then we can move to the larger of [ij and [ - , (see figure we stop when we reach boundary cell (with or - this method constructs longest common subsequence in ( madditional time figure illustration of the algorithm for constructing longest common subsequence from the array exercises for source code and help with exercisesplease visit java datastructures net