The program output is also shown below. #include #include #include…

The program output is also shown below.

1. #include
2. #include
3. #include
4. int d[100][100];
5. #define MIN(x,y) ((x)
6. int main()
7. {
8. int i,j,m,n,temp,tracker;
9. char s[] = “Sanfoundry”;
10. char t[] = “Education”;
11. m = strlen(s);
12. n = strlen(t);
14. for(i=0;i
15. d[0][i] = i;
16. for(j=0;j
17. d[j][0] = j;
19. for (j=1;j
20. {
21. for(i=1;i
22. {
23. if(s[i-1] == t[j-1])
24. {
25. tracker = 0;
26. }
27. else
28. {
29. tracker = 1;
30. }
31. temp = MIN((d[i-1][j]+1),(d[i][j-1]+1));
32. d[i][j] = MIN(temp,(d[i-1][j-1]+tracker));
33. }
34. }
35. printf(“the Levinstein distance is %d\n”,d[n][m]);
36. return 0;
37. }