a) [19 points] Carry out variable elimination (VE) on this network to compute P(S). 1. [4 points] indicate which nodes can be pruned (justifying each pruning step), and list the initial factors that VE needs to create. 2. [4 points] Assuming that the elimination ordering is alphabetical, show how the factors and the summations should be ordered. 3. [11 points] step through VE, showing what operations are performed, the resulting intermediate factors, and how P(S) is finally computed (hint: see example we traced in class). (b) [6 points] Now use VE to compute P(V | U=False). Follow the procedure outlined in (a). M O N R S U W N Y