Suppose you are given as input a rooted tree t. a labeling of the vertices with labels from the set {1, 2, 3} is called valid if the label of every vertex is different from the label of its parent. the cost of a labeling is the number of vertices with smaller labels than their parents. design an efficient algorithm to find the minimum cost of a valid labeling of t.
prove that your algorithm is correct and analyze its running time.

pay attention in your classes and concentrate the best thing you can do to raise your test scores is to pay attention when you're supposed to be learning the material: in class!

take good notes.

do your homework.

use mnemonics and other tricks.

do practice tests.

note: the best i know.

child does not get an education so she can use the molla on junk

question 1 is 8, question 2 is 9, question 3 is 24

step-by-step explanation:

now, the numbers they give you at the top are the key. from there, you just have to plug and chug! let's try 1, 2, and 3!

key: a=3, b=5, c=6

1. a+5

remember, a=3, so we plug that in to get 3+5=8

2. 15-c

c=6, so we plug that in to get 15-6=9

3. 4b

b=6, so we plug it in to get 4*6=24

time to try the rest on your own! if you put the answers below in a comment, i'll check them for you!