QUESTION $1$b $-1\backslash \%$

You have the following search tree with the goal state highlighted as node $7.$ Supposed you are asked to write down the sequences of nodes expanded by BFS and DFS when applied on this search tree. What will be the sequence for?

$-$ Breadth first search:

$-$ Depth first search:

$-$ Iterative deepening $($from level $1$ to $3$ as covered in the class$)$ QUESTION $1$c $-1\backslash \%$

In the minimizing and maximizing nodes below, fill in the values in all internal nodes represented by triangles by applying minimax algorithm. Please note that blue triangle $($facing upwards at levels $1$ and $3)$ is your maximizer and the orange triangle $($facing downwards at levels $2$ and $4)$ is your minimizer. What is the value of the game at the root node?