Based on the following search tree, C-Oh-5 C-2h-3 B C-3b-2 C-45-3 B Cw3h3 G C-7h-o D 06h-1 C-4-2 D C 5h1 D C-8-1 07-0 G C-60 each node shows both total path cost to the node and the heuristic value for the corresponding node. Note that searches are always carried out from Sto G. For each of the search strategies, work out the order in which states are expanded. Write a node including the name of the state and the cost of the path (i.e., the C value in the above figure), e.g., SO, A2, B3, etc. In all cases, assume ties break based on alphabetical order. Both result and operation process are required in your answers for full credit. a. b. c. d. e. f. Depth-first search (no visited or expanded list) Breadth-first search (with visited or expanded list) Uniform cost search (with strict expanded list) Best-first search (i.e., greedy search) (without visited or expanded list) A* search (without expanded list) Is the heuristic used in this search i) admissible? ii) consistent