（续上题）Q11.3 What is the optimal score for a timestep of 8？:

W: How much do they cost？

M: $60.

W: If we buy 30, what discount will they give us？

M: 10%.

W: What if we bought 100？

M: We'd get a higher discount, but we'd never be able to sell them all.

Questions 1-8

•For question 1-8 you will hear eight short recordings.

•For each question, mark one letter (A, B or C) for the correct answer.

•After you have listened once, replay each recording.

What will the price be if they buy 30？

A．$100

B．$54

C．$60

Q10.2 What is the size of the state space?

A、

B、

C、

D、

A、S-G

B、S-A-G

C、EARLY-GOAL-CHECKING-GRAPH-SEARCH will not find a solution path.

D、（无）

A、The EXPAND function can be called at most once for each state.

B、The algorithm is complete.

C、The algorithm will return an optimal solution.

D、（无）

Q12 Early Goal Checking Graph Search Recall from lecture the general algorithm for GRAPH-SEARCH reproduced below.With the above implementation a node that reaches a goal state may sit on the fringe while the algorithm continues to search for a path that reaches a goal state. Let's consider altering the algorithm by testing whether a node reaches a goal state when inserting into the fringe. Concretely, we add the line of code highlighted below:Now, we've produced a graph search algorithm that can find a solution faster. However, In doing so we might have affected some properties of the algorithm. To explore the possible differences, consider the example graph below.Q12.1 If using EARLY-GOAL-CHECKING-GRAPH-SEARCH with a Uniform Cost node expansion strategy, which path, if any, will the algorithm return?

A、S-G

B、S-A-G

C、EARLY-GOAL-CHECKING-GRAPH-SEARCH will not find a solution path.

D、（无）

A、The EXPAND function can be called at most once for each state.

B、The algorithm is complete.

C、The algorithm will return an optimal solution.

D、（无）

A、The EXPAND function can be called at most once for each state.

B、The algorithm is complete.

C、The algorithm will return an optimal solution.

D、（无）