: Design a system to find the minimum number of Addition/Deletion/Substitution of a single character operations are required to reach from source word to destination word from given dictionary. For...

: Design a system to find the minimum number of Addition/Deletion/Substitution of a single character operations are required to reach from source word to destination word from given dictionary. For example, for dictionary{"KEEN","AIEE","IEE","EEN","MEE","MEA", "AEE"}, minimum number of trials to reach from word "AIEE" to "IEE" is 1. Only 1 operation of deleting character 'A' is required to reach from word "AIEE" to word "IEE". Minimum number of trials to reach from "AICC" to "MCC" is 2(AICC->ICC->MCC) and minimum number of operation to reach from "AIEE" to "MEA" is 3(AIEE->IEE->MEE->MEA). If there are no valid operations with source as "AIEE" and destination as "KEEI" then it should display that "target word can't be reached".