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.

Otto used 6 cups of whole wheat flour and cause x cups of white flour in the recipe. what is the equation that can be used to find the value of y, the total amount of flour that otto used in his recipe and what are the constraints on the value of x and y? a y=6x; x is any interger greater than the equal to 0 and y is an interger greater than the equal to 6? b y=6x; is any real number greater than or equal to 0 and y is any real number greater than or equal to 6? c y=+6; x is any intger greater than or equal to 0 and y is an intger greater than or equal to 6? d y=x+6; x is any real number greater than 0 eqaul to 0 and y is any real number greater than or eqaul to 6? [someone answer this with a b c or d simplyactaully answer it this took forever to type on my phone] you. ill even raise the number of points get