Word Ladder (Shortest Transformation Path)

Problem (Coding) You are given beginWord, endWord, and a lowercase-word dictionary named wordList. A single move must replace one and only one character, and the newly formed word must be present in wordList. Print a transformation path with the minimum possible number of words from beginWord to endWord, counting both words. When no valid path can be formed, print a blank line. Input (stdin) First line: beginWord Second line: endWord Third line: integer k, the number of…