Question

3. (20 pts.) Jack has three coins C1. C2, and Cs with p. Pp2, and ps as their corresponding p1, p2, and p3 as their corresponding 3 Wit probabilities of landing heads. Jack flips coin C1 twice and then decides, based on the outcomes, whether to flip coin C2 or C3 next: if the two C1 flips come out the same, Jack flips coin C2 three times; if the two C1 flips come out different, Jack flips coin C3 three times. Given the outcome of Jack's last three flips as: tails, heads, tails, we want to know whether his first two flips came out the same. Describe a Bayesian network and a corresponding query that solves this problem

Answer 1

Solution:

Gtven tha Coins Ct, C and c^ witthi ack has t landing heads Given 3 Zein S orth Probabi tety of heads ーラBa esan netwosk Can be. conseructed al : twic oy 2- (3위iPS

Same ae diffexar Thank o