Problem 5 [20 points]. For this problem, check the Variable Elimination algorithm in your book. Also consider the Bayesian network from the "burglary" example. P(B) Burglary EarthquakePE B E A) r95 94 f 29 Alarm A IPU) JohnCalls90 MaryCalls70 a) [5 points] Apply variable elimination to the query: P(Burglary|JohnsCalls = true. MaryCalls = true) and show in detail the calculations that take place. Use your book to confirm that your answer is correct b) 5 points Count the number of arithmetic operations performed (additions, multiplications, divisions), and compare it against the number of operations performed by the tree enumera- tion algorithm c) 10 points) Suppose a Bayesian network has the from of a chain: a sequence of Boolean variables Xi, . . . X, where Parents(Xi) (Xi-1 } for i--2, . . . , n. What is the complexity of computing P(X1Xn true) using enumeration (in Big O notation)? What is the complexity with variable elimination