1. You are given n space separated strings, which represents a dictionary of words.
2. You are given another string which represents a sentence.
3. You have to print all possible sentences from the string, such that words of the sentence are
present in dictionary.
Note -> Check out the question video and write the recursive code as it is intended without
changing signature. The judge can't force you but intends you to teach a concept.Input Format
A number n n strings representing words a string representing a sentence
Output Format
Check the sample ouput and question video.
Constraints
1 <= number of words <= 10 1 <= length of each word <= 15 1 <= length of sentence <= 1000
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
11 i like pep coding pepper eating mango man go in pepcoding ilikepeppereatingmangoinpepcoding
Output
i like pepper eating man go in pep coding i like pepper eating man go in pepcoding i like pepper eating mango in pep coding i like pepper eating mango in pepcoding