Consider the problem of neatly printing a paragraph on the screen (or on a printer). For the project portion, put all functions in the file printPar. The input text is a sequence S of n words (represented as strings) of lengths `1, . . . , `n (measured in characters). The input bound M is the maximum number of characters a line can hold. The key to neatly printing a paragraph is to identify in the text sequence the lines of the paragraph so that new-lines can be placed at the end of each line. We can formalize the notion of the "badness" of a line as the number of extra space characters at the end of the line or [infinity] if the bound M is exceeded. We can formalize the notion of the "badness" of a paragraph as the badness of the worst (i. e., maximum) line of the paragraph not including the last line. Thus to identify the lines for a neat paragraph, we seek to minimize the badness of the paragraph.