I want a very detailed explanation of how to solve this problem pleaseQuestion $1-$Game theory

Imagine that, one of the friends wants to avoid the other. The problem PURSUIT$-$EVASION then becomes a two$-$player pursuit$-$evasion game. We assume now that the players take turns moving. The game ends only when the players are on the same node; the terminal payoff to the pursuer is minus the total time taken. $($The evader "wins" by never losing.$)$ as shown in Figure:

$($a$)$

Figure $1$: $($a$)$ A map where the cost of every edge is $1.$ Initially the pursuer $P$ is at node $b$ and the evader $E$ is at node d$.($b$)$ A partial game tree for this map. Each node is labeled with the P$,$E positions. P moves first. Branches marked $"?"$ have yet to be explored.

a$.$ Copy the game tree and mark the values of the terminal nodes. $(1$ point$)$

b$.$ Next to each internal node, write the strongest fact you can infer about its value $($a number, one or more inequalities such as $"14",$ or a $"?").(1$ point$)$

c$.$ Beneath each question mark, write the name of the node reached by that branch. $(1$ point$)$

d$.$ Explain how a bound on the value of the nodes in $($c$)$ can be derived from consideration of shortest$-$path lengths on the map, and derive such bounds for these nodes. Remember the cost to get to each leaf as well as the cost to solve it$.(1$ point$)$

e$.$ Now suppose that the tree as given, with the leaf bounds from $($d$),$ is evaluated from left to right. Circle those $"?"$ nodes that would not need to be expanded further, given the bounds from part $($d$),$ and cross out those that need not be considered at all. $(1$ point$)$