Sent a picture of the solution to the problem (s).
Given set S = <span>{A, B, C, D, E, F, G, H}
There are 8 elements in set S and we are to choose 3 letters at random, the number of ways to choose such is x. It is simply similar to choosing 5 letters at random, which is also equal to x. Since order doesn't matter, n! / (n-m)! where n = 8 and m = 3, which is 336 ways. </span>
Answer:
Do you still need this one?
Step-by-step explanation:

X= -4 for solving x and y= 0 for solving y