Let A equal the set of all strings of 0's, 1's, and 2's that have length 4 and for which the sum of the characters in the string is less than or equal to 2. Define a relation R on A as follows: For every
s, t ∈ A, s R t ⇔
the sum of the characters of s equals the sum of the characters of t.
It is a fact that R is an equivalence relation on A. Use set-roster notation to list the distinct equivalence classes of R. (Enter your answer as a comma-separated list of sets.)

Successful implementation of a new system is based on three independent modules. module 1 works properly with probability 0.96. for modules 2 and 3, these probabilities equal 0.95 and 0.90. compute the probability that at least one of these three modules fails to work properly.

Abag contains 3 red marbles, 2 blue marbles, and 2 green marbles. one marble is picked, then another marble. assume that the selections are made with replacement. a) find the probability of picking two red marbles with replacement. b) find the probability of picking a red marble and a blue marble. assume the selections are made without replacement. c) find the probability of picking two red marbles without replacement. d) find the probability of picking a red marble and a blue marble without replacement.

The graph of y x3 is translated so that the point (1. 1) is moved to (1, 4). what is the equation of the new graph?