Translate the following inference to logic notation: For all x, x_10 will play a game if and only if x_10 will work. For all x, x_10 is an electrician or x_10 will play a game. For all x, x_10 is not an electrician or x_10 is fast. For all x, x_10 will not work. Therefore for all x, x_10 is fast or x_10 is a scientist.
forall x: P(x) <-> Q(x). forall x: R(x) or P(x). forall x: ~R(x) or S(x). forall x: ~Q(x). Therefore forall x: S(x) or T(x).