Write the order in which nodes are expanded for each type of search:BFS or DFS.
Alpha-Beta Pruning, BFS,DFS Problem 1 – Label the statements as T (true) or F (false) a) An agent that senses only partial information about the state cannot be perfectly rational. b) It is possible for a given agent to be perfectly rational in two distinct task environments. c) A perfectly rational poker-playing agent never loses. […]