This problem asks you to prove that the set S is exactly the set of strings over {a, b} which do not contain two or more consecutive a's. In other words, you will prove that x ∈ S if and only if x does not contain two consecutive a's. The two directions of the "if and only if" are proven separately. (a) Use structural induction to prove that if a string x ∈ S, then x does not have two or more consecutive a's

Let f(x) = 3 − x . find the average rate of change of f(x) from x = a to x = a + h and simplify your answer so that no single factor of h is left in the denominator.

Look at triangle wxy what is the length (in centimeters) of the side wy of the triangle?

Use the spider tool located on page 1 of this activity to draw a 12-pointed star for the new logo. (hint: if the spider rotates 360 degrees -- or 720 degrees or 1080 degrees -- she will be facing in the same direction in which she started. when the spider is done drawing, you want her to be facing in the same direction in which she started. she'll be making 12 rotations, all the same size, so each rotation must be some multiple of 360/12 = 30 degrees.) urgently. been stuck on this problem for around 45 minutes now.! it should be easy if you're smart enough