Problem z In the same tree search problem, suppose that we have selected a heuristic given by the following table. a) Using Uniform Cost Search (UCS) algorithm, write the ordered in which the nodes are expanded in addition to the value of the expansion criterion (eg, cost) used to decide which node to expand. (Use alphabetical order to break ties). Also write the search solution reached by this al Order of node expansion Vahe of expansion criterion Repeat (b) for Greedy search, Order of node Value of expansion expansion criterion 1 A Start state 2 3 4 5 6 Search solution: A 7 18 19 10 11 12