Suppose we label all the vertices of a rooted tree T with numbers. These labels obey the property that every vertex has a label larger than the labels of its children (the vertices that it’s connected to below it). Prove by structural induction that the root has the largest label in the tree.

Anyone know? will mark brainliest if you're correct!

Aweekly newspaper charges $72 for each inch in length and one column width. what is the cost of an ad that runs 2 column inches long and 2 columns wide? its not 288

Ineed asap. 35 points. in order for two polygons to be similar, two conditions must be met. first, all pairs of corresponding sides must be in proportion. second, all corresponding angles must be congruent. prove that angle congruence is not enough, by itself, to establish that two polygons are similar. do this by describing or drawing two polygons that are not similar but whose corresponding angles are all congruent.