6. The input to this problem consists of an ordered list of n words. The length of the ith word is Wi, that is the ith word takes up w; spaces. (For simplicity assume that there are no spaces between words.) The goal is to break this ordered list of words into lines; this is called a layout. Note that you cannot reorder the words. The length of a line is the sum of the lengths of the words on that line. The maximum line length is L. Assume that wi