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.

Which is the most efficient first step to solve x in the equation 3.7x - 18 = -4.3x -34 a. add 3.7x to both sides of the equation. b. add 4.3x to both sides of the equation. c. subtract 18 from both sides of the equation. d. subtract 34 from both sides of the equation.

1. if we have 3 babies what is the probability they’re going to be all boys? 2. if we roll 2 die at the same time what is the probability of getting less than 10 on the first roll and a 5 on the second roll 3. if we have 3 babies what is the probability their is going to be 2 girls? 4. if we have 3 babies what is the probability of having no more than 1 girl? 5. it we have 3 babies and then have another 3 babies what is the probability of us having at least 1 boy and then having all girls?

Ijust need to see how to do this. so you don’t have to answer all of them just a step by step explanation of one.