A spy is undercover in the hostile country of Phonemia. In order not to waste scarce resources, every time he wants to send a message home, he removes all punctuation marks from the message and converts all letters to uppercase. So, for example, to send the message,     “Abort the plan! See you in the Dark Cabin.”     he would transmit

A spy is undercover in the hostile country of Phonemia. In order not to waste scarce resources, every time he wants to send a message

home, he removes all punctuation marks from the message and converts all letters to uppercase. So, for example, to send the message,

“Abort the plan! See you in the Dark Cabin.”

he would transmit

"ABORTTHEPLANSEEYOUINTHEDARKCABIN”

Given such a string, S, of n capital letters. Seeks to reconstruct the document using a dictionary, which is available in the form of a

boolean function dict(w), where dict(w) is true if the string w is a valid word in the language. Give an algorithm O(n^2) that determines whether the string S can be reconstituted as a sequence of valid words, assuming calls to dict(w) take O(1) of time.

To solve the problem consider:

• Indicate the subproblems

• Define the recurrence

• Propose a pseudocode

• Perform a quick Big O analysis of the algorithm