Implement the following strategy in Python: Find the first word (starting from the end of the input text) that is in the dictionary, and repeat the process.

For example, given thisisacat and a dictionary like this { this, that, is, are, a, cat, dog }. . Your algorithm will start from the end of the text and find cat in the dictionary. Then, it will repeat the same process with thisisa. It will find a. And it will continue like that. In the example above, the answer is True. However, if the text is thesearecats, then the answer is False.

In other words, the logic of this strategy can be expressed like this. Given a text t, if we can write t as uv, where v is a word in the dictionary. Then t is restorable only if u is restorable. If u is not restorable, then t is not restorable either.