Question 7 [30 pt]: The graph below is given for the following questions. The value of H defines the heuristic value of each node. In the case of a tie during expansion, i.e. you can select between two or more nodes to expand, the node with the lower alphabetical value is expanded first. For example, if during UCS the nodes A and B have the same value and could be expanded, the node A is expanded first. [You can apply either TREE search or GRAPH search, please specify which one you use for each search algorithm. e.g., "DFS - tree search".] H-3 5 5 12 H )H=2 H-2 H-9 2 H#5 For each of the following algorithms, write down the ) nodes expanded, ii the path from Start to Goal and (iii) the cost from Start to Goal 1. DFS 2. BFS 3. UCS 4. Greedy