Wagner–Fischer algorithm is used to find ____________

• A. Longest common subsequence
• B. Longest increasing subsequence
• C. Edit distance between two strings
• D. Longest decreasing subsequence