Simple Dynamic m=programming based solution for calculating the length
of the longest common subsequence for given two strings