Two buttons with smiling faces and two buttons with sad faces are in a row as shown in the picture (attached below). when you press a button the face changes, and so do the faces of the neighboring buttons. what is the minimum number of button presses needed so that only smiling faces can be seen? Note: neighboring buttons = buttons NEXT to it.

its 0.1 miles per minute

for the first question it would be the second answer for the second question it would be the third answer and for the third question it would be the first answer

step-by-step explanation:

step-by-step explanation:

always plug in x. in this case, x equals 4.

i'm going to first solve 4(2+3x)

1) 4(2+3(4)) use pemdas to solve.

i'm going to multiply whats in the parenthesis first, so 3 times 4=12.

2)4 (2+12) i'm then going to multiply 4 by both numbers in the parenthesis (because multiplying comes before adding)

4 times 2= 8.   4 times 12= 48

4) (8+48)= 56 (answer)

i'm then going to solve 8+12x and plug in 4 for x.

1) 8 +12(4)

multiplying comes before adding, so i'm gonna multiply 12 and 4.

12 times 4= 48.

2) 8+48=56

both equal the same!

the equation cos(35) =a/25 can be used to find the length of bc what is the length of bc? round to the nearest tenth

step-by-step explanation: