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
I have been asked this question in an interview for internship.
This interesting question is from Wagner-Fischer Algorithm in division Dynamic Programming of Data Structures & Algorithms II