Given a string s, and a list of strings called dictionary, write a brute force algorithm that decides whether you can create the string s using the words in the dictionary. You are allowed to use the dictionary more than once. Example1: s = beststudent dictionary = [best, teacher, student, fast] output = True Example2: s =fastcar dictionary = [best, teacher, student, fast] output = False

The input to the algorithm is sand the dictionary. You can assume that you have a function that checks if a word is in the dictionary or not, IsInDictionary(word, dictio- nary) which returns true or false. Hint: It will be easier to implement this recursively.