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. 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. (14) b. What job sequence does Beam Search provide as a solution to this problem? (1)