If using the A search algorithm to find a path from S to Q using the given heuristic, what will be th number of extended nodes (NXN), Number-of-Enqueued Nodes (NEN), Cost of the path? a) NXN=4, b) NXN=9, c) NXN=8, d) NXN=4, e) NXN=4, NEN=9, NEN=5, NEN=11. NEN=8, NEN=9, Cost =4 Cost =4 Cost =9 Cost =5 Cost =5 Q 5. Assume the following tree to represent the different possible paths that can be taken by game. If the maximizer player starts the game, determine the sequence of plays dictated by search algorithm. The alphabetical symbols refer to the nodes and the numerical values are utility function for the leave nodes. a) ABEMS b) ACG c) ACH d) ABEL e) ADIO If using the A search algorithm to find a path from S to Q using the given heuristic, what will be th number of extended nodes (NXN), Number-of-Enqueued Nodes (NEN), Cost of the path? a) NXN=4, b) NXN=9, c) NXN=8, d) NXN=4, e) NXN=4, NEN=9, NEN=5, NEN=11. NEN=8, NEN=9, Cost =4 Cost =4 Cost =9 Cost =5 Cost =5 Q 5. Assume the following tree to represent the different possible paths that can be taken by game. If the maximizer player starts the game, determine the sequence of plays dictated by search algorithm. The alphabetical symbols refer to the nodes and the numerical values are utility function for the leave nodes. a) ABEMS b) ACG c) ACH d) ABEL e) ADIO