Problem n8 suppose that t is a tree with six vertices, exactly three of which have degree one. prove that g has exactly two vertices of degree two and one vertex of degree three.

Design an er diagram for keeping track of information about votes taken in the u. s. house of representatives during the current two-year congressional session. the database needs to keep track of each u. s. state's name (e. g., texas', new york', california') and include the region of the state (whose domain is {northeast', midwest', southeast', southwest', west'}). each congress person in the house of representatives is described by his or her name, plus the district represented, the start date when the congressperson was first elected, and the political party to which he or she belongs (whose domain is {republican', democrat', 'independent', other'}). the database keeps track of each bill (i. e., proposed law), including the bill name, the date of vote on the bill, whether the bill passed or failed (whose domain is {yes', no'}), and the sponsor (the congressperson(s) who sponsored - that is, proposed - the bill). the database also keeps track of how each congressperson voted on each bill (domain of vote attribute is {yes', no', abstain', absent'}). additional information: