The sample space has 36 equally likely ordered pairs (x,y).
Mutually exclusive and exhaustive. For any two numbers x and y, exactly one of x>y, x<y, x=y is true. So every outcome lies in one and only one of E1, E2, E3. No outcome is in two of them, so E1∩E2=E2∩E3=E1∩E3=ϕ (mutually exclusive), and every outcome is in one of them, so E1∪E2∪E3=S (exhaustive). (1 mark)
P(E3). E3={(1,1),(2,2),(3,3),(4,4),(5,5),(6,6)}, so
P(E3)=366=61
(1 mark)
P(E1) and P(E2). The remaining 36−6=30 outcomes are shared between E1 and E2. Swapping the two numbers turns each outcome of E1 into one of E2, for example (5,2)↔(2,5), so the two events have the same number of outcomes: 30÷2=15 each. (Directly: E1 has 0+1+2+3+4+5=15 outcomes, counting by the first number 1, 2, ..., 6.)
P(E1)=P(E2)=3615=125
Check: 125+125+61=1. (1 mark)