Acoin is tossed 2 times. display all possible outcomes in an organized list. (h, h), (h, t), (t, h), (h, h) (h, h), (h, t), (t, h), (h, h) (h, h), (h, t), (t, t), (h, t) (h, t), (t, h), (t, t) (t, h) (t, t), (t, h), (h, t), (h, h)

It’s the last one because that one has no repeats. One outcome can not be listed twice

the square root of what number? if you add that, then someone will probably answer the question.

sorry i need the points

step-by-step explanation:

biuuyb i\

uygybg bsyvyuenrs

ufir7gyuuf6

y6fy