Given a non$-$empty string s and a dictionary containing a list of unique words, design a dynamic programming algorithm to determine if s can be segmented into a space$-$separated sequence of one or more dictionary words. If s $=$algorithmdesign$$ and your dictionary contains $$algorithm$$ and $$design$.$ Your algorithm should answer Yes as s can be segmented as $$algorithm design$$