Apply alpha-beta search (from left to right) to the following game tree. Show the backed-up value of each node (provisional values found for nodes by the search process; no values for nodes that are not examined). Mark with an X any branches that are not searched.
Mark the best move with an arrow.