consider the following simple procedure Parse$($S$)$: find the smallest i such that S$[0$:i$]$ is a valid word, cut it off, and recurse on the remaining string $($i$.$e$.$ return Parse$($S$[$i$+1,$ len$($S$)-1])).$ does this always produce a valid split? $[$Hint: consider the example dictionary above...$]$