Write an algorithm to find longest common subsequence that runs in approximately O(n 2 ). Show how to improve it to O(nlog 2 n).