$9.$

Which search method takes less memory?

a$)$ Depth$-$First Search b$)$ Breadth$-$First search

c$)$ Optimal search d$)$ Linear Search

$10.$

The performance of an agent can be improved by $\_\_\_\_\_\_\_\_\_\_$

a$)$ Learning b$)$ Observing

c$)$ Perceiving d$)$ None of the mentioned

$11.$

A search algorithm takes $\_\_\_\_\_\_\_\_\_$ as an input and returns $\_\_\_\_\_\_\_\_$ as an output.

a$)$ Input, output b$)$ Problem, solution

c$)$ Solution, problem d$)$ Parameters, sequence of actions

$12.$

The Set of actions for a problem in a state space is formulated by a $\_\_\_\_\_\_\_\_\_\_\_$

a$)$ Intermediate states

b$)$ Initial state

c$)$ Successor function, which takes current action and returns next immediate state

d$)$ None of the mentioned