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 ) 00 EarthquakePE 002 B EP(A) Alarm 94 f 29 f f.00 A P(J) .90 f.05 A P(M) JohnCalls 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 X1,... Xn where Parents(Xi)-{X,-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 liination? 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 ) 00 EarthquakePE 002 B EP(A) Alarm 94 f 29 f f.00 A P(J) .90 f.05 A P(M) JohnCalls 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 X1,... Xn where Parents(Xi)-{X,-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 liination