Consider a 4-job scheduling problem to minimize a function Z. The table below lists every possible partial solution, except the empty set, and its corresponding objective function value. Partial solution 1*** 2*** 3*** 4*** 12** 13** 14** 21* 23** 24** ** Z 17 19 16 18 18 20 21 20 22 23 Partial solution 31** 32** 34** 41** 42** 43** 1234 1243 1324 1342 Z 22 21 19 19 22 20 21 26 20 22 Partial solution 1423 1432 2134 2143 2314 2341 2413 2431 3124 3142 Z 23 24 26 22 25 28 24 26 26 25 Partial solution 3214 3241 3412 3421 4123 4132 4213 4231 4312 4321 b. What job sequence does Beam Search provide as a solution to this problem? Z 24 27 25 23 20 21 24 25 22 24 a. Apply Beam Search using a beam width of 2. Construct the search tree of sub-problems (or nodes) that Beam Search would generate from the root node, . Label each node with its partial solution and its Z-value. Number the nodes according to the order in which the nodes are generated, given that one always branches on the available node with the smallest Z value first.