Write a Python program to solve the following search problem: Two words (strings) and a dictionary of legal English words are given. At each step, you can change any single letter in the word to any other letter, provided that the result is a word in the dictionary.

Program should print the shortest list of words that connects the two given words in this way (if there are multiple such paths, any one is sufficient).

1. Your code should take 3 arguments: The dictionary's file name, the start word, and the target word

2. dictionary path as /usr/share/dict/words.

You should then print the chain of words that leads from the start word to the target word.

Print each word an a newline.

If it impossible find a path then output: "No solution" You can assume you will be given valid start and target words.