a) (1 point) b0 = (1/3, 1/3, 0, 1/3)
b) (2 points) b’ = (2/3, 0, 1/3, 0)
c) (2 points) b1 = (1, 0, 0, 0)
d) (1 point) b2 = (0, 0, 1, 0)
e) (4 points)
f) (2 points) All non goal states have non zero probability
a) binary marking
b) 1 for final answer, 1 for explanation (either using belief vectors or by reasoning)
c) 1 for final answer, 1 for explanation (either using belief vectors or by reasoning)
d) binary marking
e) 1 marks for correctly labelling the left subtree (with a=left) and 3 marks for the right subtree
f) 1 mark for correct answer, 1 mark for explanation (qualitative)
Note : If answer to part a is wrong then partial marking in parts b to e have been awarded if methods and explanations are correct