Problem 5 [20 points]. For this problem, check the Variable Elimination algorithm in your book Also consider the Bayesian network from the "burglary" example Burglary P(B) 001 Earthquake P(E) 002 B EP(A) Alarm f 94 f .29 f f001 A PU) A P(M) JohnCalls 90 MaryCalls70 f 01 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 X, , . . . Xn where Parents(Xi)-(Xi-l} for i-2. . . . , n. What is the complexity of computing P(X1|Xn- true) using enumeration (in Big O notation)? What is the complexity with variable elimination