Throughout, P(C1)=P(C2)=P(C3)=31, and C1,C2,C3 are mutually exclusive and exhaustive.
(a) From the rules, P(H3∣C1)=21, P(H3∣C2)=1 and P(H3∣C3)=0. By the theorem of total probability,
P(H3)=31⋅21+31⋅1+31⋅0=21
(b) By Bayes' theorem,
P(C1∣H3)=P(H3)P(C1)P(H3∣C1)=2131⋅21=31
P(C2∣H3)=P(H3)P(C2)P(H3∣C2)=2131⋅1=32
(and P(C3∣H3)=0, since the host never opens the door hiding the car). Switching to door 2 wins with probability 32, against 31 for keeping door 1, so the contestant should switch.
(c) P(C1∩H3)=P(C1)P(H3∣C1)=61, and P(C1)P(H3)=31⋅21=61.
Since P(C1∩H3)=P(C1)P(H3), the events are independent: seeing the host open door 3 does not change the chance that the contestant's own door hides the car (it stays 31, as found in (b)). Note that C2 and H3 are not independent, because P(C2∣H3)=32=31.
(d) Now P(H3∣C1)=1, P(H3∣C2)=1, P(H3∣C3)=0, so P(H3)=31+31=32 and
P(C1∣H3)=3231⋅1=21
Let H2 be the event that he opens door 2. Then P(H2∣C1)=0, P(H2∣C2)=0, P(H2∣C3)=1, so P(H2)=31 and
P(C3∣H2)=3131⋅1=1
So with this host, opening door 3 makes keeping and switching equally good, while opening door 2 tells the contestant for certain that the car is behind door 3.
(e) Let G be the event that the host opens door 3 and it shows a goat. The host's choice does not depend on the car, so P(opens door 3)=21 in every case, and door 3 shows a goat unless the car is behind it:
P(G∣C1)=21,P(G∣C2)=21,P(G∣C3)=0
P(G)=31⋅21+31⋅21+0=31,P(C1∣G)=3131⋅21=21
So with a host who does not know, door 1 and door 2 are equally likely (21 each), and switching gives no advantage. The answer differs from (b) because a knowing host was certain to show a goat, while this host could have revealed the car.