Find the smallest number of colors needed to properly vertex-color each of the above graphs. Note that the vertices are drawn so that you can fill them in with colors, should you happen to have colored pens/pencils with you (and should you be willing to write in a book, unless of course you are working from a photocopied page, in which case there should be no problem . . . do you think it is possible to have a parenthetical remark that is longer than the parent sentence?).